A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems

Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Talbi. A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems. In 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), Proceedings, 26-30 March 2007, Long Beach, California, USA. pages 1-9, IEEE, 2007. [doi]

@inproceedings{MezmazMT07:0,
  title = {A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems},
  author = {Mohand-Said Mezmaz and Nouredine Melab and El-Ghazali Talbi},
  year = {2007},
  doi = {10.1109/IPDPS.2007.370217},
  url = {http://dx.doi.org/10.1109/IPDPS.2007.370217},
  tags = {optimization},
  researchr = {https://researchr.org/publication/MezmazMT07%3A0},
  cites = {0},
  citedby = {0},
  pages = {1-9},
  booktitle = {21th International Parallel and Distributed Processing Symposium (IPDPS 2007), Proceedings, 26-30 March 2007, Long Beach, California, USA},
  publisher = {IEEE},
}