Branching rules revisited

Authors:
Tobias Achterberg;Thorsten Koch;Alexander Martin
Affiliations:
Konrad-Zuse-Zentrum für Informationstechnik Berlin, Germany;Konrad-Zuse-Zentrum für Informationstechnik Berlin, Germany;Technische Universität Darmstadt, Schloígartenstr. 7, D-64289 Darmstadt, Germany
Venue:
Operations Research Letters
Year:
2005

Citing 3
Cited 25

Decomposing Matrices into Blocks

SIAM Journal on Optimization
A Computational Study of Search Strategies for Mixed Integer Programming

INFORMS Journal on Computing
Finding Cuts in the TSP (A preliminary report)

Finding Cuts in the TSP (A preliminary report)

Orbitopal Fixing

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach

Computers and Operations Research
Hybrid Branching

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Computational Experience with a Software Framework for Parallel Integer Programming

INFORMS Journal on Computing
Branching and bounds tighteningtechniques for non-convex MINLP

Optimization Methods & Software - GLOBAL OPTIMIZATION
Faster MIP solutions via new node selection rules

Computers and Operations Research
Constraint integer programming: a new approach to integrate CP and MIP

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Computing with multi-row gomory cuts

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Faster integer-feasibility in mixed-integer linear programs by branching to force change

Computers and Operations Research
On the Complexity of Selecting Disjunctions in Integer Programming

SIAM Journal on Optimization
Global optima for the Zhou---Rozvany problem

Structural and Multidisciplinary Optimization
Lower tolerance-based Branch and Bound algorithms for the ATSP

Computers and Operations Research
A probing algorithm for MINLP with failure prediction by SVM

CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Quantified linear programs: a computational study

ESA'11 Proceedings of the 19th European conference on Algorithms
Solving Large p-Median Problems with a Radius Formulation

INFORMS Journal on Computing
Experiments with a generic dantzig-wolfe decomposition for integer programs

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
An integer programming and decomposition approach to general chance-constrained mathematical programs

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Information-theoretic approaches to branching in search

Discrete Optimization
An algorithmic framework for convex mixed integer nonlinear programs

Discrete Optimization
A new Branch and Bound method for a discrete truss topology design problem

Computational Optimization and Applications
On branching rules for convex mixed-integer nonlinear optimization

Journal of Experimental Algorithmics (JEA)
A specialized branch & bound & cut for Single-Allocation Ordered Median Hub Location problems

Discrete Applied Mathematics
Backdoor Branching

INFORMS Journal on Computing
GloMIQO: Global mixed-integer quadratic optimizer

Journal of Global Optimization
Learning Bayesian network structure: Towards the essential graph by integer linear programming tools

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new generalization called reliability branching of today's state-of-the-art strong branching and pseudocost branching strategies for linear programming based branch-and-bound algorithms. After reviewing commonly used branching strategies and performing extensive computational studies we compare different parameter settings and show the superiority of our proposed new strategy.