Inverse Optimization: An Application to the Capacitated Plant Location Problem

DOI10.1287/MNSC.27.10.1120zbMATH Open0465.90027OpenAlexW2052210854MaRDI QIDQ3917865FDOQ3917865

Authors: Gabriel Bitran, Vijaya Chandru, Dorothy E. Sempolinski, Jeremy F. Shapiro 

Publication date: 1981

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/5161

zbMATH Keywords

logisticsinverse optimizationcomputational experienceparametric methodscapacitated plant location problemLagrangean techniques

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Inventory, storage, reservoirs (90B05)

Cited In (11)

• Approximate solutions to large scale capacitated facility location problems
• An algorithm for solving large capacitated warehouse location problems
• Low earth orbit satellite based communication systems -- research opportunities
• Heuristic algorithms for the inverse mixed integer linear programming problem
• Valid inequalities and facets of the capacitated plant location problem
• A note on node aggregation and Benders' decomposition
• A heuristic lagrangean algorithm for the capacitated plant location problem
• A generalized model of sequential decisionmaking under risk
• A Lagrangian heuristic for the capacitated plant location problem with single source constraints
• An improved cut-and-solve algorithm for the single-source capacitated facility location problem
• Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems

This page was built for publication: Inverse Optimization: An Application to the Capacitated Plant Location Problem

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