Cloud Branching

DOI10.1007/978-3-642-38171-3_3zbMath1382.90059OpenAlexW4244853844MaRDI QIDQ4922902

Domenico Salvagnin, Timo Berthold

Publication date: 4 June 2013

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38171-3_3

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

On the complexity of finding shortest variable disjunction branch-and-bound proofs ⋮ Multivariable Branching: A 0-1 Knapsack Problem Case Study ⋮ An exploratory computational analysis of dual degeneracy in mixed-integer programming ⋮ Improving strong branching by domain propagation ⋮ Ten years of feasibility pump, and counting

Uses Software

• SCIP
• SoPlex
• MIPLIB
• FEASPUMP
• Chaff
• MIPLIB2003

This page was built for publication: Cloud Branching