General models in min-max continuous location: Theory and solution techniques
From MaRDI portal
Publication:2564174
DOI10.1007/BF02192640zbMath0866.90084OpenAlexW2116884024MaRDI QIDQ2564174
J. B. G. Frenk, Joaquim A. S. Gromicho, Shu-Zhong Zhang
Publication date: 7 January 1997
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02192640
Related Items
On the planar piecewise quadratic 1-center problem, Reference variable methods of solving min-Max optimization problems, General models in min-max planar location: Checking optimality conditions, Location problems with different norms for different points, A deep cut ellipsoid algorithm for convex programming: Theory and applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A destination optimality in asymmetric distance Fermat-Weber problems
- Lower subdifferentiable functions and their minimization by cutting planes
- Localization in single facility location
- Estimating road distances by mathematical functions
- Lexicographical order and duality in multiobjective programming
- Geometric algorithms and combinatorial optimization
- A deep cut ellipsoid algorithm for convex programming: Theory and applications
- Approximation of solutions for location problems
- General models in min-max planar location: Checking optimality conditions
- Some properties of nondifferentiable pseudoconvex functions
- Using Block Norms for Location Modeling
- Using deep cuts in an ellipsoid algorithm for nonlinear programming
- On the Solution of Variational Inequalities by the Ellipsoid Method
- Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
- Family of algorithms for solving convex programming problems
- Feature Article—The Ellipsoid Method: A Survey
- There is no Differentiable Metric for R n
- Convergence Rates of the Ellipsoid Method on General Convex Functions
- State Constraints in Convex Control Problems of Bolza
- Modelling Inter-city Road Distances by Mathematical Functions
- Location Theory, Dominance, and Convexity