Location problems with grouped structure of demand: Complexity and algorithms

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199803)31:2<81::AID-NET3>3.0.CO;2-F" /><81::AID-NET3>3.0.CO;2-F 10.1002/(SICI)1097-0037(199803)31:2<81::AID-NET3>3.0.CO;2-FzbMATH Open0936.90033OpenAlexW1994817401MaRDI QIDQ4260014

Igor Averbakh, Oded Berman

Publication date: 25 May 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199803)31:2<81::aid-net3>3.0.co;2-f

zbMATH Keywords

strongly polynomial algorithmsmultifacility location

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

This page was built for publication: Location problems with grouped structure of demand: Complexity and algorithms