Handler, Gabriel Y. Complexity and efficiency in minimax network location. (English) Zbl 0427.90082 Combinatorial optimization, Summer Sch., Sogesta, Urbino 1977, 281-314 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page MSC: 90C35 Programming involving graphs or networks 90C10 Integer programming 68Q25 Analysis of algorithms and problem complexity 65K05 Numerical mathematical programming methods Keywords:minimax network location; network location; complexity of algorithms; centre problems on networks; absolute m-centre problem; relaxation technique; set covering problems; NP-completeness Citations:Zbl 0401.00019 PDF BibTeX XML OpenURL