User menu

Efficient Points On a Network

Bibliographic reference Hansen, P. ; Thisse, Jacques-François ; Wendell, RE.. Efficient Points On a Network. In: Networks (New York) : an international journal, Vol. 16, no. 4, p. 357-368 (1986)
Permanent URL http://hdl.handle.net/2078.1/54771
  1. Chalmet, Eur. J. Opercitionol Res., 6, 117 (1981)
  2. Church, Transportation Sci., 12, 107 (1978)
  3. Dijkstra, Numerische Math., 1, 269 (1959)
  4. and . Location on Networks. MIT Press. Cambridge. MA, 1979.
  5. Hansen, Discrere Appl. Math., 2, 151 (1980)
  6. Hansen, Ann. Discrete Math., 19, 201 (1984)
  7. and , Fundamentals of Computer Algorithms. Pitman. London, 1978.
  8. Karlsson, Discrete App. Math., 6, 91 (1983)
  9. On a pair of dual nonlinear programs. I. Nonlinear Programming, (Ed.), North-Holland, Amsterdam, 1967, 37–54.
  10. Lowe, Trans protation Sci., 12, 298 (1978)
  11. Lowe, Management Sci., 30, 1346 (1984)
  12. A new method for checking the consistency of precedence matrices. J. Assoc. Computing Machinery (1959) 164–172.
  13. Thisse, Operations Res., 32, 1309 (1984)
  14. and , Characterizing efficient points in location problems under the one-infinity norm. I. Locationcal Analysis of Public Fucilitirs, and (Eds.), North-Holland. Amsterdam. 1983, 413–429.
  15. Wendell Richard E., Hurter Arthur P., Lowe Timothy J., Efficient Points in Location Problems, 10.1080/05695557708975152