Polyhedral analysis and decompositions for capacitated plant location-type problems

DOI10.1016/S0166-218X(97)00096-6zbMath0897.90153OpenAlexW1964096843MaRDI QIDQ1383369

Monique Guignard, Bintong Chen

Publication date: 26 October 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

polyhedral structuregeneralized capacitated plant locationspecially structured mixed integer programming

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (6)

Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches ⋮ Lagrangean relaxation. (With comments and rejoinder). ⋮ On solving large instances of the capacitated facility location problem ⋮ An homage to Joseph-Louis Lagrange and Pierre Huard ⋮ Facility location models for distribution system design ⋮ Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems

Cites Work

• Unnamed Item
• A comparison of heuristics and relaxations for the capacitated plant location problem
• Layering strategies for creating exploitable structure in linear and integer programs
• Lagrangean decomposition for integer nonlinear programming with linear constraints
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Lagrangean decomposition for integer programming : theory and applications
• Lagrangean Decomposition In Integer Linear Programming: A New Scheme
• Dynamic Production Scheduling for a Process Industry

This page was built for publication: Polyhedral analysis and decompositions for capacitated plant location-type problems