An Efficient Computational Procedure for Solving the Multi-Facility Rectinlinear Facilities Location Problem.

Abstract

The multi-facility location problem with rectilinear distances is considered. A necessary and sufficient optimality condition is stated and proved. An algorithm is developed and computational results are given. A new lower bound for multifacility problems with l sub p distances is also given. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1977
Accession Number
ADA038953

Entities

People

  • Henrik Juel
  • Robert Love

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Concrete
  • Convex Programming
  • Linear Programming
  • Materials
  • Mathematics
  • North Carolina
  • Numbers
  • Plastic Explosives
  • Prestressed Concrete
  • Real Numbers
  • Schools
  • United States
  • Universities
  • Wisconsin

Fields of Study

  • Mathematics

Readers

  • Operations Research