On the Benefits of Using NP-hard Problems in Branch & Bound
From MaRDI portal
Publication:5392093
DOI10.1007/978-3-642-00142-0_75zbMath1209.90355OpenAlexW94792778MaRDI QIDQ5392093
Cornelius Schwarz, Jörg Rambau
Publication date: 7 April 2011
Published in: Operations Research Proceedings 2008 (Search for Journal in Brave)
Full work available at URL: https://epub.uni-bayreuth.de/587/1/rambau_schwarz.pdf
Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items