Skip to Main content Skip to Navigation
Conference papers

An efficient hybrid peer-to-peer approach for non-redundant tree exploration in branch and bound algorithms

Malika Mehdi Mohand Mezmaz 1 Nouredine Melab 2 El-Ghazali Talbi 2 Pascal Bouvry 3
1 LIFL - Laboratoire d'Informatique Fondamentale de Lille
2 DOLPHIN - Parallel Cooperative Multi-criteria Optimization
Inria Lille - Nord Europe, LIFL - Laboratoire d'Informatique Fondamentale de Lille
3 Uni.lu - Université du Luxembourg
Document type :
Conference papers
Complete list of metadata
https://hal.inria.fr/hal-00837521
Contributor : Talbi El-Ghazali Connect in order to contact the contributor
Submitted on : Saturday, June 22, 2013 - 5:40:10 PM
Last modification on : Thursday, January 20, 2022 - 5:27:49 PM

Identifiers

  • HAL Id : hal-00837521, version 1

Collections

CNRS | INRIA | LIFL | UNIV-LILLE3 | CRISTAL | CRISTAL-DOLPHIN

Citation

Malika Mehdi, Mohand Mezmaz, Nouredine Melab, El-Ghazali Talbi, Pascal Bouvry. An efficient hybrid peer-to-peer approach for non-redundant tree exploration in branch and bound algorithms. Int. Workshop on P2P Parallel Grid and Internet Computing (3PGIC) in conjunction with CISIS, Mar 2008, Barcelona, Spain. ⟨hal-00837521⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Les métriques sont temporairement indisponibles

 

Contact                    Legal Notice                    Personal Data