An efficient hybrid peer-to-peer approach for non-redundant tree exploration in branch and bound algorithms - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

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

, (1) , (2) , (2) , (3)
1
2
3
Malika Mehdi
  • Function : Author
  • PersonId : 880269
Mohand Mezmaz
  • Function : Author
  • PersonId : 834174
Laboratoire d'Informatique Fondamentale de Lille
Nouredine Melab
  • Function : Author
  • PersonId : 834175
Parallel Cooperative Multi-criteria Optimization
El-Ghazali Talbi
Parallel Cooperative Multi-criteria Optimization
Pascal Bouvry
  • Function : Author
  • PersonId : 866914
Université du Luxembourg

Domains

Computer Science [cs] Operations Research [cs.RO]

TALBI El-Ghazali  : Connect in order to contact the contributor

https://hal.inria.fr/hal-00837521

Submitted on : Saturday, June 22, 2013-5:40:10 PM

Last modification on : Thursday, January 20, 2022-5:27:49 PM

Not file

Dates and versions

hal-00837521 , version 1 (22-06-2013)

Identifiers

  • HAL Id : hal-00837521 , version 1

Cite

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 Dublin Core DC Terms EndNote Datacite

Collections

UNIV-LILLE3 CNRS INRIA LIFL CRISTAL INRIA2 CRISTAL-DOLPHIN
99 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More