• Issue

    Networks: Volume 21, Issue 2

    fmi, 133-255
    March 1991
Previous Issue|Next Issue
Export Citation(s)Download PDF(s)

Masthead

Free Access

Masthead

  • Page: fmi
  • First Published: March 1991

Articles

Full Access

Unbalanced, capacitated p-median problems on a chain graph with a continuum of link demands

Hanif D. Sherali,  Thomas P. Rizzo, 
  • Pages: 133-163
  • First Published: March 1991
Full Access

Maximum matchings in bipartite graphs via strong spanning trees

M. L. Balinski,  J. Gonzalez, 
  • Pages: 165-179
  • First Published: March 1991
Full Access

On the existence of uniformly optimally reliable networks

F. T. Boesch,  X. Li,  C. Suffel, 
  • Pages: 181-194
  • First Published: March 1991
Full Access

Polynomial time algorithms on circular-arc overlap graphs

Toshinobu Kashiwabara,  Sumio Masuda,  Kazuo Nakajima,  Toshio Fujisawa, 
  • Pages: 195-203
  • First Published: March 1991
Full Access

Faster parametric shortest path and minimum-balance algorithms

Neal E. Young,  Robert E. Tarjant,  James B. Orlin, 
  • Pages: 205-221
  • First Published: March 1991
Full Access

Parametric analysis of optimal facility locations

Margaret L. Brandeau,  Samuel S. Chiu, 
  • Pages: 223-243
  • First Published: March 1991
Full Access

Conditional graph connectivity relative to hereditary properties

Ortrud R. Oellermann, 
  • Pages: 245-255
  • First Published: March 1991