Locating facilities in three‐dimensional space by convex programming
From MaRDI portal
Publication:5589764
Cites work
- A Network Minimization Problem [Letter to the Editor]
- A Stochastic Programming Model
- An Application of Dynamic Programming to Location—Allocation Problems
- Cauchy's method of minimization
- Extensions of SUMT for Nonlinear Programming: Equality Constraints and Extrapolation
- Heuristic Methods for Location-Allocation Problems
- Location-Allocation Problems
- Sufficient Conditions for Some Optimum-Property Facility Designs
- The Backboard Wiring Problem: A Placement Algorithm
- The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
Cited in
(12)- An algorithm for the solution of a location problem with metric constraints
- Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick
- Nearest neighbor distance in three-dimensional space
- When facilities coincide: Exact optimality conditions in multifacility location
- Location of regional facilities
- Solving multifacility location problems involving euclidean distances
- A quadratically convergent method for minimizing a sum of euclidean norms
- Location of facilities with rectangular distances among point and area destinations
- Properties of a multifacility location problem involving euclidian distances
- Duality for constrained multifacility location problems with mixed norms and applications
- An iterative algorithm for the multifacility minimax location problem with euclidean distances
- Normative location theory: Placement in continuous space
This page was built for publication: Locating facilities in three‐dimensional space by convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5589764)
