Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information

DOI10.1016/j.ejor.2005.02.051zbMath1131.90076OpenAlexW1995895592MaRDI QIDQ858332

Jorge R. Vera, Iván Derpich

Publication date: 9 January 2007

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

Full work available at URL: http://hdl.handle.net/10533/177802

zbMATH Keywords

discrete optimizationBranch and Bound

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

Improved branching disjunctions for branch-and-bound: an analytic center approach ⋮ Stochastic level-value approximation for quadratic integer convex programming ⋮ Using modifications to Grover's search algorithm for quantum global optimization ⋮ Unnamed Item ⋮ Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis

Uses Software

• TOMLAB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric algorithms and combinatorial optimization.
• The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
• Integer Programming with a Fixed Number of Variables
• An Automatic Method of Solving Discrete Programming Problems
• A polynomial invariant for knots via von Neumann algebras
• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• Experiments in mixed-integer linear programming using pseudo-costs
• Branch and Bound Methods for Mathematical Programming Systems
• A Computational Study of Search Strategies for Mixed Integer Programming
• Incorporating Condition Measures into the Complexity Theory of Linear Programming
• A tree-search algorithm for mixed integer programming problems
• Experiments in mixed-integer linear programming
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• Investigation of some branch and bound strategies for the solution of mixed integer linear programs
• On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System