Faster integer-feasibility in mixed-integer linear programs by branching to force change
From MaRDI portal
Publication:632648
DOI10.1016/J.COR.2010.10.025zbMATH Open1208.90122OpenAlexW2068537726MaRDI QIDQ632648FDOQ632648
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
Recommendations
Cites Work
- MIPLIB 2003
- Octane: A New Heuristic for Pure 0–1 Programs
- Benchmarking optimization software with performance profiles.
- Branching rules revisited
- The feasibility pump
- Noncommercial software for mixed-integer linear programming
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- Optimal scrap combination for steel production
- MIP models and BB strategies in brachytherapy treatment optimization
- Counting Solutions of Knapsack Constraints
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
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
Uses Software
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)
