A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem

Duc-Cuong Dang, Racha El-Hajj, Aziz Moukrim

Open source

DOI
10.1007/978-3-642-38171-3_23
Published
2013-05-18
Container
Not recorded
Publisher
Not recorded
Open access
yes

Credibility signals

limited evidence Score 45/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1007/978-3-642-38171-3_23,
  title = {A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem},
  author = {Duc-Cuong Dang and Racha El-Hajj and Aziz Moukrim},
  year = {2013},
  doi = {10.1007/978-3-642-38171-3_23},
  url = {https://doi.org/10.1007/978-3-642-38171-3_23}
}

RIS

TY  - JOUR
TI  - A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
AU  - Duc-Cuong Dang
AU  - Racha El-Hajj
AU  - Aziz Moukrim
PY  - 2013
DO  - 10.1007/978-3-642-38171-3_23
UR  - https://doi.org/10.1007/978-3-642-38171-3_23
ER  - 

APA

Dang, D., El-Hajj, R., & Moukrim, A. (2013). A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem. https://doi.org/10.1007/978-3-642-38171-3_23

Source records