Faster MIP solutions via new node selection rules

DOI10.1016/j.cor.2009.11.011zbMath1190.90109OpenAlexW2050721868MaRDI QIDQ2270439

Daniel T. Wojtaszek, John W. Chinneck

Publication date: 18 March 2010

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

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

zbMATH Keywords

branch and boundmixed-integer programmingnode selection rules

Mathematics Subject Classification ID

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

Related Items

Achieving MILP feasibility quickly using general disjunctions ⋮ Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs ⋮ Optimal Learning in Linear Regression with Combinatorial Feature Selection ⋮ An effective hybrid approach to the two-stage capacitated facility location problem ⋮ From feasibility to improvement to proof: three phases of solving mixed-integer programs ⋮ Comments on: ``On learning and branching: a survey

Uses Software

• SCIP
• MIPLIB
• GLPK
• MINTO
• MIPLIB2003
• COIN/BCP

Cites Work

• Unnamed Item
• SCIP: solving constraint integer programs
• Integer-programming software systems
• Active-constraint variable ordering for faster feasibility of mixed integer linear programs
• Branching rules revisited
• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• Experiments in mixed-integer linear programming using pseudo-costs
• A Computational Study of Search Strategies for Mixed Integer Programming
• A tree-search algorithm for mixed integer programming problems
• Experiments in mixed-integer linear programming
• Investigation of some branch and bound strategies for the solution of mixed integer linear programs
• Genetic Programming
• Benchmarking optimization software with performance profiles.