Reformulation of capacitated facility location problems: How redundant information can help
From MaRDI portal
Publication:1270613
DOI10.1023/A:1018966804496zbMath0911.90235MaRDI QIDQ1270613
Publication date: 3 November 1998
Published in: Annals of Operations Research (Search for Journal in Brave)
modelingfacility locationcutting planesrelaxationscutting plane algorithmcapacitated combinatorial optimization problems
Integer programming (90C10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (13)
A new mixed integer linear programming model for the multi level uncapacitated facility location problem ⋮ A review of hierarchical facility location models ⋮ An effective hybrid approach to the two-stage capacitated facility location problem ⋮ Preprocessing and cutting for multiple allocation hub location problems. ⋮ Multi-period capacitated location with modular equipments ⋮ Multi-level facility location problems ⋮ A splitter location-allocation problem in designing fiber optic access networks ⋮ Facility location models for distribution system design ⋮ Weak flow cover inequalities for the capacitated facility location problem ⋮ A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem ⋮ Excess information in parametric linear optimization ⋮ Locating repair shops in a stochastic environment ⋮ Logic-based benders decomposition for an inter-modal transportation problem
Uses Software
This page was built for publication: Reformulation of capacitated facility location problems: How redundant information can help
