On the separability of subproblems in Benders decompositions

DOI10.1007/s10479-008-0383-5zbMath1181.90230OpenAlexW2063964339MaRDI QIDQ846136

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

zbMATH Keywords

constraint programmingproblem separation

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Uses Software

• OTTER
• CSPLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Evaluating ASP and commercial solvers on the CSPLib
• Partitioning procedures for solving mixed-variables programming problems
• Logic-based Benders decomposition
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
• Permutation Problems and Channelling Constraints
• Integrating Benders Decomposition Within Constraint Programming

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