Faster MIP solutions via new node selection rules

DOI10.1016/J.COR.2009.11.011MaRDI QIDQ2270439zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Further results on an abstract model for branching and its application to mixed integer programming
• Active-constraint variable ordering for faster feasibility of mixed integer linear programs
• An abstract model for branching and its application to mixed integer programming
• Information-based branching schemes for binary linear mixed integer problems
• MIP: Theory and practice -- closing the gap

Cites work

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

Cited in

(7)

• A new node selection strategy in the branch-and-bound procedure
• An effective hybrid approach to the two-stage capacitated facility location problem
• Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs
• Optimal learning in linear regression with combinatorial feature selection
• Achieving MILP feasibility quickly using general disjunctions
• From feasibility to improvement to proof: three phases of solving mixed-integer programs
• Comments on: ``On learning and branching: a survey

Describes a project that uses

Uses Software

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

This page was built for publication: Faster MIP solutions via new node selection rules

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