Refine
Year of publication
Document Type
- ZIB-Report (10)
- Article (4)
- In Proceedings (1)
Language
- English (15)
Is part of the Bibliography
- no (15)
Keywords
- linear programming (3)
- mixed-integer semidefinite programming (3)
- Steiner tree optimization (2)
- branch-and-cut (2)
- branch-and-price (2)
- column generation framework (2)
- constraint integer programming (2)
- mixed-integer linear programming (2)
- mixed-integer nonlinear programming (2)
- optimization solver (2)
- parallelization (2)
- Branch-and-cut (1)
- Branch-and-price (1)
- Column generation (1)
- Constraint integer programming (1)
- IP (1)
- LP solver (1)
- LP, MIP, CIP, MINLP, modeling, optimization, SCIP, SoPlex, Zimpl (1)
- Linear programming (1)
- MINLP solver (1)
- MIP (1)
- MIP solver (1)
- MIPLIB (1)
- Mixed Integer Programming (1)
- Mixed-integer linear programming (1)
- Mixed-integer nonlinear programming (1)
- Mixed-integer semidefinite programming (1)
- Optimization solver (1)
- Parallelization (1)
- Problem Instances (1)
- Steiner tree solver (1)
- branch-cut-and-price framework (1)
- generic column generation (1)
- mixed-integer linear and nonlinear programming (1)
- mixed-integer programming, branch-and-bound, branching rule, strong branching (1)
- modeling (1)
- multi-criteria optimization (1)
- parallel branch-and-bound (1)
- simplex method (1)
- supply chain management, supply network optimization, mixed-integer linear programming, primal heuristics, numerical stability, large-scale optimization (1)
In mixed-integer programming, the branching rule is a key component to a fast convergence of the branch-and-bound algorithm. The most common strategy is to branch on simple disjunctions that split the domain of a single integer variable into two disjoint intervals. Multi-aggregation is a presolving step that replaces variables by an affine linear sum of other variables, thereby reducing the problem size. While this simplification typically improves the performance of MIP solvers, it also restricts the degree of freedom in variable-based branching rules.
We present a novel branching scheme that tries to overcome the above drawback by considering general disjunctions defined by multi-aggregated variables in addition to the standard disjunctions based on single variables. This natural idea results in a hybrid between variable- and constraint-based branching rules. Our implementation within the constraint integer programming framework SCIP incorporates this into a full strong branching rule and reduces the number of branch-and-bound nodes on a general test set of publicly available benchmark instances. For a specific class of problems, we show that the solving time decreases significantly.