Spatial and objective decompositions for very large SCAPs

DOI10.1007/978-3-642-21311-3_8MaRDI QIDQ3003275zbMATH OpenOpenAlexFDO

Authors Carleton Coffrin, Pascal Van Hentenryck, Russell Bent

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

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

Cited in

(5)

• Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
• Transmission system repair and restoration
• A linear-programming approximation of AC power flows
• Multicriteria optimization in humanitarian aid
• Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size

Describes a project that uses

Uses Software

• COMET

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)