Branching from the largest upper bound. Folklore and facts

DOI10.1016/0377-2217(78)90092-9zbMath0381.90075OpenAlexW2084904294MaRDI QIDQ1247917

Alexander H. G. Rinnooy Kan, Jan Karel Lenstra, Linus Schrage, Bennett L. Fox

Publication date: 1978

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://ageconsearch.umn.edu/record/272158/files/erasmus095.pdf

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

A parallel branch and bound algorithm for the quadratic assignment problem, Performances of parallel branch and bound algorithms with best-first search, Heuristics and their design: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound
• Branch-and-Bound Methods: A Survey
• An Improved Implicit Enumeration Approach for Integer Programming
• Accelerating List Processing in Discrete Programming
• Experiments in mixed-integer linear programming