On the Separability of Subproblems in Benders Decompositions.
Marco CadoliFabio PatriziPublished in: CPAIOR (2006)
Keyphrases
- decomposition method
- decomposition methods
- minimum cost
- decomposition algorithm
- benders decomposition
- np hard
- dimensionality reduction
- optimization problems
- singular value decomposition
- network design problem
- constraint satisfaction problems
- mixed integer
- lagrangian relaxation
- reducing the search space
- relational databases
- class separability