Solving a selected class of location problems by exploiting problem structure: A decomposition approach

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6750(199812)45:8<791::AID-NAV3>3.0.CO;2-H" /><791::AID-NAV3>3.0.CO;2-H 10.1002/(SICI)1520-6750(199812)45:8<791::AID-NAV3>3.0.CO;2-HzbMath0936.90042OpenAlexW2007794739MaRDI QIDQ4248931

Dilip Chhajed, Timothy J. Lowe

Publication date: 10 June 1999

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199812)45:8<791::aid-nav3>3.0.co;2-h

zbMATH Keywords

location problemsdual problems\(m\)-median problem with mutual communicationLagrangian decomposition scheme

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

This page was built for publication: Solving a selected class of location problems by exploiting problem structure: A decomposition approach