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

DOI10.1016/j.cor.2010.10.025zbMath1208.90122OpenAlexW2068537726MaRDI QIDQ632648

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)

Related Items (5)

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

Uses Software

• MIPLIB
• GLPK
• FEASPUMP
• MIPLIB2003
• Octane

Cites Work

• Unnamed Item
• 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
• Branching rules revisited
• MIPLIB 2003
• The feasibility pump
• Octane: A New Heuristic for Pure 0–1 Programs
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
• Counting Solutions of Knapsack Constraints
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming
• Benchmarking optimization software with performance profiles.

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