A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Data and Resources
Additional Info
| Field | Value |
|---|---|
| Source | IEEE International Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. |
| Author | Mezmaz, Mohand, Melab, Nouredine, Talbi, El-Ghazali |
| Maintainer | CCSD |
| Last Updated | May 10, 2026, 10:59 (UTC) |
| Created | May 10, 2026, 10:59 (UTC) |
| Identifier | hal-00841951 |
| Language | en |
| Rights | https://about.hal.science/hal-authorisation-v1/ |
| contributor | Institut de Mathématiques [Mons] ; Université de Mons = University of Mons (UMONS) |
| coverage | Long Beach, CA, United States |
| creator | Mezmaz, Mohand |
| date | 2007-03-26T00:00:00 |
| harvest_object_id | dd08d7ad-db9e-4e97-8e87-811585662101 |
| harvest_source_id | 3374d638-d20b-4672-ba96-a23232d55657 |
| harvest_source_title | test moissonnage SELUNE |
| metadata_modified | 2025-09-01T00:00:00 |
| set_spec | type:COMM |