Solving general continuous single facility location problems by cutting planes

DOI10.1016/0377-2217(87)90198-6zbMath0608.90022OpenAlexW1982793679MaRDI QIDQ1086129

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

zbMATH Keywords

minimaxouter approximationcomputational resultsmixed normsminisumcontinuous single facility locationconvex transportation costsnear optimality regionsunified cutting plane method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05)

Related Items (14)

A generalized Weber problem with different gauges for different regions ⋮ The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm ⋮ Nondifferentiability detection and dimensionality reduction in minisum multifacility location problems ⋮ A discretizing algorithm for location problems ⋮ Use of reference points for solving MONLP problems ⋮ Dominating sets for convex functions with some applications ⋮ A new algorithm for the minimax location problem with the closest distance ⋮ GBSSS: The generalized big square small square method for planar single- facility location ⋮ Minimal containment under homothetics: a simple cutting plane approach ⋮ When facilities coincide: Exact optimality conditions in multifacility location ⋮ Asymmetric distances, semidirected networks and majority in Fermat-Weber problems ⋮ Some personal views on the current state and the future of locational analysis ⋮ A geometrical solution for quadratic bicriteria location models ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower subdifferentiable functions and their minimization by cutting planes
• Localization in single facility location
• The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
• Newton's method for convex programming and Tschebyscheff approximation
• An algorithm for the minimax Weber problem
• Weighted min-max location problems: Polynomially bounded algorithms
• An improved vertex enumeration algorithm
• The Cutting-Plane Method for Solving Convex Programs
• Using Block Norms for Location Modeling
• The Minisum and Minimax Location Problems Revisited
• Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
• Fixed Point Optimality Criteria for the Location Problem with Arbitrary Norms
• On minimax optimization problems
• Technical Note—Location Theory: A Selective Bibliography
• The Minimum Covering Sphere Problem
• A note on Fermat's problem
• Location Theory, Dominance, and Convexity

This page was built for publication: Solving general continuous single facility location problems by cutting planes