General models in min-max planar location: Checking optimality conditions
From MaRDI portal
Publication:2564175
Recommendations
Cites work
- A destination optimality in asymmetric distance Fermat-Weber problems
- General models in min-max continuous location: Theory and solution techniques
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 3425889 (Why is no real title available?)
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3574390 (Why is no real title available?)
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- Localization in single facility location
- Small-dimensional linear programming and convex hulls made easy
Cited in
(6)- On the planar piecewise quadratic 1-center problem
- General models in min-max continuous location: Theory and solution techniques
- Location problems with different norms for different points
- Robustness in the Pareto-solutions for the multi-criteria minisum location problem
- scientific article; zbMATH DE number 1417899 (Why is no real title available?)
- Solving nonconvex planar location problems by finite dominating sets
This page was built for publication: General models in min-max planar location: Checking optimality conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2564175)