On the separability of subproblems in Benders decompositions

DOI10.1007/S10479-008-0383-5MaRDI QIDQ846136zbMATH OpenOpenAlexFDO

Authors 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)

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

Cites work

• scientific article; zbMATH DE number 158462 (Why is no real title available?)
• scientific article; zbMATH DE number 3474957 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1550909 (Why is no real title available?)
• Algorithms for hybrid MILP/CP models for a class of optimization problems
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Evaluating ASP and commercial solvers on the CSPLib
• Integrating Benders Decomposition Within Constraint Programming
• Logic-based Benders decomposition
• Partitioning procedures for solving mixed-variables programming problems
• Permutation Problems and Channelling Constraints

Cited in

(6)

• Subproblem separation in logic-based Benders' decomposition for the vehicle routing problem with local congestion
• Benders decomposition without separability: a computational study for capacitated facility location problems
• Benders decomposition: solving binary master problems by enumeration
• From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints
• Integrating Benders Decomposition Within Constraint Programming
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Describes a project that uses

Uses Software

• CSPLib
• OTTER

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)