On the set partitioning type formulation for the discrete location problem

DOI10.1016/0305-0548(86)90073-0zbMath0617.90020OpenAlexW1984631041MaRDI QIDQ1088881

P. Bairaktaris, J. Darzentas

Publication date: 1986

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(86)90073-0

zbMATH Keywords

discrete locationset partitioning

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Inventory, storage, reservoirs (90B05)

Related Items

A heuristic method for large-scale multi-facility location problems ⋮ Location-allocation on a line with demand-dependent costs

Cites Work

• Locational analysis
• The simple plant location problem: Survey and synthesis
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure