Optimization Bounds from the Branching Dual

DOI10.1287/ijoc.2018.0884OpenAlexW2962841287WikidataQ127498566 ScholiaQ127498566MaRDI QIDQ5139843

Gerdus Benadè, John N. Hooker

Publication date: 11 December 2020

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.07584

zbMATH Keywords

dual boundsminimum bandwidthbranching dual

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items

Logic-Based Benders Decomposition for Large-Scale Optimization

Uses Software

• SCIP
• Gecode

Cites Work

• Unnamed Item
• Orbital branching
• Integrated methods for optimization
• Depth-first iterative-deepening: An optimal admissible tree search
• Branching rules revisited
• Laying Out Sparse Graphs with Provably Minimum Bandwidth
• Decorous Lower Bounds for Minimum Linear Arrangement
• On the Probable Performance of Heuristics for Bandwidth Minimization
• Experiments in mixed-integer linear programming using pseudo-costs
• A Computational Study of Search Strategies for Mixed Integer Programming
• Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
• Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
• A remark on a problem of Harary
• Experiments in mixed-integer linear programming
• A Machine Learning-Based Approximation of Strong Branching
• Failure-Directed Search for Constraint-Based Scheduling