Cloud branching

DOI10.1007/978-3-642-38171-3_3zbMATH Open1382.90059OpenAlexW4244853844MaRDI QIDQ4922902FDOQ4922902

Authors: Timo Berthold, Domenico Salvagnin 

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

Recommendations

• Branching rules revisited
• An abstract model for branching and its application to mixed integer programming
• Branching on nonchimerical fractionalities
• Decomposition Branching for Mixed Integer Programming
• Local branching

Mathematics Subject Classification ID

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

Cited In (9)

• An exploratory computational analysis of dual degeneracy in mixed-integer programming
• On computing small variable disjunction branch-and-bound trees
• Branching rules revisited
• Multivariable Branching: A 0-1 Knapsack Problem Case Study
• Ten years of feasibility pump, and counting
• On the complexity of finding shortest variable disjunction branch-and-bound proofs
• Faster integer-feasibility in mixed-integer linear programs by branching to force change
• Improving strong branching by domain propagation
• Backdoor branching

Uses Software

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

This page was built for publication: Cloud branching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922902)