Solving the dynamic facility location problem
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199609)28:2<117::AID-NET5>3.0.CO;2-H" /><117::AID-NET5>3.0.CO;2-H 10.1002/(SICI)1097-0037(199609)28:2<117::AID-NET5>3.0.CO;2-HzbMath0864.90073OpenAlexW2110215353MaRDI QIDQ5689823
Marie-Christine Costa, Alain Sutter, Pierre Chardaire
Publication date: 7 January 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199609)28:2<117::aid-net5>3.0.co;2-h
Lagrangian relaxationsimulated annealinglower boundsheuristictelecommunicationduality gapsintelligent networks0-1 quadratic programdynamic, uncapacited facility location problem
Quadratic programming (90C20) Communication networks in operations research (90B18) Discrete location and assignment (90B80) Boolean programming (90C09)
Related Items (22)
This page was built for publication: Solving the dynamic facility location problem