BINDING INEQUALITIES FOR TREE NETWORK LOCATION PROBLEMS WITH DISTANCE CONSTRAINTS

The paper considers the problem of finding locations of several new facilities in an imbedded tree network with respect to existing facilities at known locations so as to satisfy distance constraints, which impose upper bounds on distances between pairs of facilities. It is shown how the multiobjective results provide insight into the question of lowest computational order of an algorithm for determining whether or not the distance constraints are consistent.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    428 East Preston Street
    Baltimore, MD  USA  21202
  • Authors:
    • Tansel, B C
    • Francis, R L
    • Lowe, T J
  • Publication Date: 1980-5

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00329602
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: May 21 1981 12:00AM