Locating facilities in three‐dimensional space by convex programming

DOI10.1002/nav.3800160405zbMath0194.20805OpenAlexW1530761718MaRDI QIDQ5589764

Love, Robert F.

Publication date: 1969

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800160405

zbMATH Keywords

operations research

Related Items (12)

Location of regional facilities ⋮ Location of facilities with rectangular distances among point and area destinations ⋮ An algorithm for the solution of a location problem with metric constraints ⋮ Unnamed Item ⋮ Properties of a multifacility location problem involving euclidian distances ⋮ Duality for constrained multifacility location problems with mixed norms and applications ⋮ Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick ⋮ A quadratically convergent method for minimizing a sum of euclidean norms ⋮ When facilities coincide: Exact optimality conditions in multifacility location ⋮ Normative location theory: Placement in continuous space ⋮ Solving multifacility location problems involving euclidean distances ⋮ An iterative algorithm for the multifacility minimax location problem with euclidean distances

Cites Work

• Cauchy's method of minimization
• The Backboard Wiring Problem: A Placement Algorithm
• A Network Minimization Problem [Letter to the Editor]
• The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
• Location-Allocation Problems
• Heuristic Methods for Location-Allocation Problems
• A Stochastic Programming Model
• An Application of Dynamic Programming to Location—Allocation Problems
• Extensions of SUMT for Nonlinear Programming: Equality Constraints and Extrapolation
• Sufficient Conditions for Some Optimum-Property Facility Designs

This page was built for publication: Locating facilities in three‐dimensional space by convex programming