Solving general continuous single facility location problems by cutting planes
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3819468 (Why is no real title available?)
- scientific article; zbMATH DE number 3825682 (Why is no real title available?)
- scientific article; zbMATH DE number 3526459 (Why is no real title available?)
- scientific article; zbMATH DE number 3027356 (Why is no real title available?)
- A note on Fermat's problem
- An algorithm for the minimax Weber problem
- An improved vertex enumeration algorithm
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
- Fixed Point Optimality Criteria for the Location Problem with Arbitrary Norms
- Localization in single facility location
- Location Theory, Dominance, and Convexity
- Lower subdifferentiable functions and their minimization by cutting planes
- Newton's method for convex programming and Tschebyscheff approximation
- On minimax optimization problems
- Technical Note—Location Theory: A Selective Bibliography
- The Cutting-Plane Method for Solving Convex Programs
- The Minimum Covering Sphere Problem
- The Minisum and Minimax Location Problems Revisited
- The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
- Using Block Norms for Location Modeling
- Weighted min-max location problems: Polynomially bounded algorithms
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)
