Improving strong branching by domain propagation
- 1 August 2014
- journal article
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 2 (3) , 99-122
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Information-theoretic approaches to branching in searchDiscrete Optimization, 2011
- Active-constraint variable ordering for faster feasibility of mixed integer linear programsMathematical Programming, 2006
- MIPLIB 2003Operations Research Letters, 2006
- Branching rules revisitedOperations Research Letters, 2005
- Decomposing Matrices into BlocksSIAM Journal on Optimization, 1998
- Experiments in mixed-integer linear programming using pseudo-costsMathematical Programming, 1977
- Investigation of some branch and bound strategies for the solution of mixed integer linear programsMathematical Programming, 1973
- Experiments in mixed-integer linear programmingMathematical Programming, 1971
- A tree-search algorithm for mixed integer programming problemsThe Computer Journal, 1965
- An Automatic Method of Solving Discrete Programming ProblemsEconometrica, 1960