Spatial and objective decompositions for very large SCAPs
DOI10.1007/978-3-642-21311-3_8zbMATH Open1302.68250OpenAlexW1538449744MaRDI QIDQ3003275FDOQ3003275
Russell Bent, Carleton Coffrin, Pascal Van Hentenryck
Publication date: 26 May 2011
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-21311-3_8
Recommendations
- Algorithms for large scale set covering problems
- Decomposition strategies for large-scale continuous location–allocation problems
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- A decomposition approach for single allocation hub location problems with multiple capacity levels
- scientific article; zbMATH DE number 975772
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)
Cited In (5)
- A Linear-Programming Approximation of AC Power Flows
- Transmission system repair and restoration
- Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size
- Multicriteria optimization in humanitarian aid
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
Uses Software
This page was built for publication: Spatial and objective decompositions for very large SCAPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003275)
