Achieving MILP feasibility quickly using general disjunctions

DOI10.1016/J.COR.2013.03.001MaRDI QIDQ336442zbMATHOpenAlexFDO

Authors Hanan Mahmoud, John W. Chinneck

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

branchingmixed integer linear programminggeneral disjunctions

Mathematics Subject Classification ID

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

Recommendations

• An approach for the optimal solution of MILP problems
• Generalized disjunctive programming: solution strategies
• Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
• Solving mixed integer bilinear problems using MILP formulations
• Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
• A hierarchy of relaxations for linear generalized disjunctive programming
• Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
• The MILP-relaxation approach
• Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
• A disjunctive cutting plane procedure for general mixed-integer linear programs

Cites work

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

Cited in

(6)

• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
• Improved strategies for branching on general disjunctions
• Experimental results on using general disjunctions in branch-and-bound for general-integer linear programming
• Branching on general disjunctions
• Compressing branch-and-bound trees
• Improved branching disjunctions for branch-and-bound: an analytic center approach

Describes a project that uses

Uses Software

• MIPLIB
• CPLEX
• GLPK
• FEASPUMP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336442)