Achieving MILP feasibility quickly using general disjunctions

DOI10.1016/j.cor.2013.03.001zbMath1348.90491OpenAlexW2026627205MaRDI QIDQ336442

John W. Chinneck, Hanan Mahmoud

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.03.001

zbMATH Keywords

mixed integer linear programmingbranchinggeneral disjunctions

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (3)

Improved branching disjunctions for branch-and-bound: an analytic center approach ⋮ Compressing branch-and-bound trees ⋮ Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II

Uses Software

• MIPLIB
• CPLEX
• GLPK
• FEASPUMP

Cites Work

• Branching on general disjunctions
• Faster integer-feasibility in mixed-integer linear programs by branching to force change
• Improved strategies for branching on general disjunctions
• Active-constraint variable ordering for faster feasibility of mixed integer linear programs
• Faster MIP solutions via new node selection rules
• Feasibility and infeasibility in optimization. Algorithms and computational methods.
• The feasibility pump
• On the Complexity of Selecting Disjunctions in Integer Programming
• Experiments in mixed-integer linear programming
• Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
• Benchmarking optimization software with performance profiles.

This page was built for publication: Achieving MILP feasibility quickly using general disjunctions