Article1973

A Dual Decomposition Method for Minimizing Transportation Costs in Multifacility Location Problems

18 citations0/0 files storedTransportation Science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Facility Location and Emergency Management Vehicle Routing Optimization Methods Optimization and Mathematical Programming

Abstract

This paper develops the dual program of the constrained multifacility location problem in which total transportation cost in the system is proportional to the sum of the weighted Euclidean distances between facilities. A decomposition solution method is presented in which the master program is linear and each subprogram is a nonlinear programming problem. Computation results are presented and discussed.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 18 citations exist upstream.

References

1963Location-Allocation Problems 1964Heuristic Methods for Location-Allocation Problems 1971Optimal Center Location in Simple Networks 1969Optimal Locations for Centers in a Network 1970A Network Flow Solution to a Rectilinear Distance Facility Location Problem 1967An Algorithm and Computational Procedure for Locating Economic Facilities 1972A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem 1971Technical Note—The Optimal Location of New Facilities Using Rectangular Distances

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.