Location problems with grouped structure of demand: Complexity and algorithms

DOI10.1002/(SICI)1097-0037(199803)31:2%3C81::AID-NET3%3E3.0.CO;2-FMaRDI QIDQ4260014zbMATH OpenOpenAlexFDO

Authors 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%3C81::aid-net3%3E3.0.co;2-f

zbMATH Keywords

multifacility locationstrongly polynomial algorithms

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• Improved complexity results for several multifacility location problems on trees
• Solving Structured Multifacility Location Problems Efficiently
• Multi-level facility location problems
• MULTI-FACILITY LOCATION PROBLEM WITH NONINCREASING PIECEWISE LINEAR DEMAND ON A TREE

Cited in

(3)

• Multi-level facility location problems
• Solving Structured Multifacility Location Problems Efficiently
• Parallel Complexity of Additive Location Problems

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

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