Faster integer-feasibility in mixed-integer linear programs by branching to force change

DOI10.1016/J.COR.2010.10.025MaRDI QIDQ632648zbMATH OpenOpenAlexFDO

Authors Jennifer Pryor, John W. Chinneck

Publication date 25 March 2011

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

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

zbMATH Keywords

branchingmixed-integer programminginteger feasibility

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Recommendations

• Active-constraint variable ordering for faster feasibility of mixed integer linear programs
• Branching on nonchimerical fractionalities
• An abstract model for branching and its application to mixed integer programming
• Branching rules revisited
• Cloud branching

Cites work

• Active-constraint variable ordering for faster feasibility of mixed integer linear programs
• Benchmarking optimization software with performance profiles.
• Branching rules revisited
• Counting Solutions of Knapsack Constraints
• MIP models and BB strategies in brachytherapy treatment optimization
• MIPLIB 2003
• Noncommercial software for mixed-integer linear programming
• Octane: A New Heuristic for Pure 0–1 Programs
• Optimal scrap combination for steel production
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming
• The feasibility pump

Cited in

(6)

• Comments on: ``On learning and branching: a survey
• Branching on nonchimerical fractionalities
• Achieving MILP feasibility quickly using general disjunctions
• Active-constraint variable ordering for faster feasibility of mixed integer linear programs
• Structure-driven fix-and-propagate heuristics for mixed integer programming
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning

Describes a project that uses

Uses Software

• Octane
• MIPLIB2003
• FEASPUMP
• GLPK
• MIPLIB

This page was built for publication: Faster integer-feasibility in mixed-integer linear programs by branching to force change

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