On the separability of subproblems in Benders decompositions

DOI10.1007/S10479-008-0383-5zbMATH Open1181.90230OpenAlexW2063964339MaRDI QIDQ846136FDOQ846136

Marco Cadoli, Fabio Patrizi

Publication date: 1 February 2010

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-008-0383-5

Recommendations

• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Benders decomposition without separability: a computational study for capacitated facility location problems
• Integrating Benders Decomposition Within Constraint Programming
• Logic-based Benders decomposition
• Extension of the generalized benders' decomposition

zbMATH Keywords

constraint programmingproblem separation

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Partitioning procedures for solving mixed-variables programming problems
• Title not available (Why is that?)
• Logic-based Benders decomposition
• Evaluating ASP and commercial solvers on the CSPLib
• Title not available (Why is that?)
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Title not available (Why is that?)
• Algorithms for hybrid MILP/CP models for a class of optimization problems
• Permutation Problems and Channelling Constraints
• Integrating Benders Decomposition Within Constraint Programming
• Title not available (Why is that?)

Cited In (3)

• Benders decomposition: solving binary master problems by enumeration
• Integrating Benders Decomposition Within Constraint Programming
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Uses Software

• OTTER
• CSPLib

This page was built for publication: On the separability of subproblems in Benders decompositions

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