Polyhedral analysis and decompositions for capacitated plant location-type problems

DOI10.1016/S0166-218X(97)00096-6MaRDI QIDQ1383369zbMATH OpenOpenAlexFDO

Authors Bintong Chen, Monique Guignard

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

generalized capacitated plant locationpolyhedral structurespecially structured mixed integer programming

Mathematics Subject Classification ID

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

Recommendations

• Valid inequalities and facets of the capacitated plant location problem
• A Facility Location Problem With Aggregate Capacity
• Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
• Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
• Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems

Cites work

• A comparison of heuristics and relaxations for the capacitated plant location problem
• Dynamic Production Scheduling for a Process Industry
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• Lagrangean decomposition for integer nonlinear programming with linear constraints
• Lagrangean decomposition for integer programming : theory and applications
• Lagrangean Decomposition In Integer Linear Programming: A New Scheme
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Layering strategies for creating exploitable structure in linear and integer programs

Cited in

(12)

• The plant location problem with discrete capacities and indivisible customers
• Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
• Lagrangean relaxation. (With comments and rejoinder).
• Polyhedral study of simple plant location problem with order
• On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
• scientific article; zbMATH DE number 4095174 (Why is no real title available?)
• A polyhedral analysis of the capacitated edge activation problem with uncertain demands
• An homage to Joseph-Louis Lagrange and Pierre Huard
• Lagrangean relaxation-based techniques for solving facility location problems
• Facility location models for distribution system design
• On solving large instances of the capacitated facility location problem
• Multiobjective capacitated plant location problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383369)