Branch and bound, integer, and non-integer programming

DOI10.1007/s10479-006-0112-xzbMath1213.90018OpenAlexW1981018363WikidataQ56552017 ScholiaQ56552017MaRDI QIDQ537592

Yong-Cai Geng, Sumit K. Garg

Publication date: 20 May 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-006-0112-x

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03)

Related Items (2)

The Lagrangian relaxation for the combinatorial integral approximation problem ⋮ SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework

Cites Work

• On the Solution of Discrete Programming Problems
• An Automatic Method of Solving Discrete Programming Problems
• A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems
• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• Global optimization using special ordered sets
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• Branch and Bound Methods for Mathematical Programming Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Branch and bound, integer, and non-integer programming