Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
Discrete Optimization · 2016-02 · 19 · 79-102
DOI: 10.1016/j.disopt.2016.01.005 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Optimization, 2016-02. Verfasst von David R. Morrison und 3 weiteren Autor:innen. Die Arbeit wurde bisher 524-mal zitiert (Crossref) und nennt 136 Literaturangaben. Gefördert von: Air Force Office of Scientific Research, U.S. Department of Defense, National Science Foundation.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Air Force Office of Scientific Research
- U.S. Department of Defense
- National Science Foundation
Zitieren
APA
Morrison, D. R., Jacobson, S. H., Sauppe, J. J., & Sewell, E. C. (2016). Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning. Discrete Optimization, 19, 79-102. https://doi.org/10.1016/j.disopt.2016.01.005
Vancouver
Morrison DR, Jacobson SH, Sauppe JJ, Sewell EC. Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning. Discrete Optimization. 2016;19:79-102. doi:10.1016/j.disopt.2016.01.005
BibTeX
@article{Morrison2016,
author = {Morrison, David R. and Jacobson, Sheldon H. and Sauppe, Jason J. and Sewell, Edward C.},
title = {Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning},
journal = {Discrete Optimization},
year = {2016},
volume = {19},
pages = {79--102},
doi = {10.1016/j.disopt.2016.01.005}
}
EUVIMED