Solving general continuous single facility location problems by cutting planes
DOI10.1016/0377-2217(87)90198-6zbMATH Open0608.90022OpenAlexW1982793679MaRDI QIDQ1086129FDOQ1086129
Authors: Frank Plastria 
Publication date: 1987
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(87)90198-6
Recommendations
- A discretizing algorithm for location problems
- Locating an undesirable facility by generalized cutting planes.
- General models in min-max continuous location: Theory and solution techniques
- Continuous multifacility ordered median location problems
- Solving capacitated facility location problems by Fenchel cutting planes
minimaxmixed normsouter approximationcomputational resultsminisumcontinuous single facility locationconvex transportation costsnear optimality regionsunified cutting plane method
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05)
Cites Work
- Title not available (Why is that?)
- A note on Fermat's problem
- The Cutting-Plane Method for Solving Convex Programs
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
- Using Block Norms for Location Modeling
- The Minisum and Minimax Location Problems Revisited
- The Minimum Covering Sphere Problem
- Newton's method for convex programming and Tschebyscheff approximation
- Location Theory, Dominance, and Convexity
- Localization in single facility location
- Lower subdifferentiable functions and their minimization by cutting planes
- Technical Note—Location Theory: A Selective Bibliography
- Fixed Point Optimality Criteria for the Location Problem with Arbitrary Norms
- Title not available (Why is that?)
- The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
- Title not available (Why is that?)
- Weighted min-max location problems: Polynomially bounded algorithms
- An algorithm for the minimax Weber problem
- An improved vertex enumeration algorithm
- Title not available (Why is that?)
- On minimax optimization problems
Cited In (18)
- Minimal containment under homothetics: a simple cutting plane approach
- The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
- A generalized Weber problem with different gauges for different regions
- Technical Note—Counterexamples for the Location of Emergency Service Facilities
- A new algorithm for the minimax location problem with the closest distance
- When facilities coincide: Exact optimality conditions in multifacility location
- Use of reference points for solving MONLP problems
- Asymmetric distances, semidirected networks and majority in Fermat-Weber problems
- Dominating sets for convex functions with some applications
- Solving capacitated facility location problems by Fenchel cutting planes
- GBSSS: The generalized big square small square method for planar single- facility location
- A geometrical solution for quadratic bicriteria location models
- Some personal views on the current state and the future of locational analysis
- The Weiszfeld Algorithm: Proof, Amendments, and Extensions
- Nondifferentiability detection and dimensionality reduction in minisum multifacility location problems
- A discretizing algorithm for location problems
- Locating an undesirable facility by generalized cutting planes.
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
This page was built for publication: Solving general continuous single facility location problems by cutting planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086129)
