Opening book details…
Can I read Complexity of Robust Single Facility Location Problems on Networks with Uncertain Edge Lengths on EtoBox?
Complexity of Robust Single Facility Location Problems on Networks with Uncertain Edge Lengths by Igor Averbakh is a Computer Science article available to read on EtoBox.
What is Complexity of Robust Single Facility Location Problems on Networks with Uncertain Edge Lengths about?
We consider single-facility location problems on a network with uncertain edge lengths. Specifically, the lengths of edges are assumed to be random with unknown distributions and can take on any values within prespeciÿed intervals of uncertainty. Uncertainty in edge lengths re ects uncertainty in transportation times, or transportation costs, along the edges. It is required to ÿnd a robust (minmax regret) solution, that is, a location which is -optimal for any possible realization of edge lengths, with as small as possible. We show that such robust location problems are strongly NP-hard, in contrast with robust location problems with only node weights uncertainty that are known to be polynomially solvable.
Who reads Complexity of Robust Single Facility Location Problems on Networks with Uncertain Edge Lengths?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Igor Averbakh
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0166-218X)
- Published
- 2003
- Language
- EN
- Field
- Computer Science (Physical Sciences)