Exact sequential choice of locations in a network

G.R. Mateus and J.‐M. Thizy

Annals of Operations Research, 1999, vol. 86, issue 0, 199-219

Abstract: Medium to large network location problems can often be solved only approximatelywithin reasonable computing time. Standard solution techniques focus on the tentative choiceof locations embedded in an enumerative search. In contrast, the method presented hereselects or rejects facilities conclusively and thus avoids costly backtracking schemes. Itdraws on supermodularity and Lagrangian relaxation. We rank well‐known variable‐fixingtests and propose a hierarchy of tests that provides an attractive time‐accuracy trade‐offwhich we assess computationally. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018950617642 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:86:y:1999:i:0:p:199-219:10.1023/a:1018950617642

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018950617642

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().