Some Properties of Location Problems with Block and Round Norms
From MaRDI portal
Recommendations
- El conjunto eficiente en problemas de localizacion con normas mixtas (L p)
- A polygonal upper bound for the efficient set for single-facility location problems with mixed norms
- An Approach to Location Models Involving Sets as Existing Facilities
- On the Set of Optimal Points to the Weber Problem: Further Results
- A localization property for facility-location problems with arbitrary norms
Cited in
(37)- Geometrical properties of the Fermat-Weber problem
- Localization in multifacility location theory
- Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization
- Was Euclid an unnecessarily sophisticated psychologist?
- A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem
- Some personal views on the current state and the future of locational analysis
- Efficiency in Euclidean constrained location problems
- Algebraic properties of location problems with one circular barrier.
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
- A polygonal upper bound for the efficient set for single-facility location problems with mixed norms
- Local convexity results in a generalized Fermat-Weber problem
- Approximation of solutions for location problems
- Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
- Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm
- A characterization of efficient points in constrained location problems with regional demand
- Multiobjective analysis of facility location decisions
- Pareto envelopes in simple polygons
- El conjunto eficiente en problemas de localizacion con normas mixtas (L p)
- Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
- Relationships between constrained and unconstrained multi-objective optimization and application in location theory
- Using Block Norms for Location Modeling
- Un algorithme pour résoudre une famille de problèmes de localisation multisources
- A localization property for facility-location problems with arbitrary norms
- Meilleure approximation en norme vectorielle et théorie de la localisation
- Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I.
- Minimal enclosing discs, circumcircles, and circumcenters in normed planes. II.
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
- scientific article; zbMATH DE number 1417899 (Why is no real title available?)
- Pareto efficient solutions in multi-objective optimization involving forbidden regions
- Obnoxious facility location in multiple dimensional space
- Hamilton-Jacobi scaling limits of Pareto peeling in 2D
- Local convergence in a generalized Fermat-Weber problem
- Counterfactual explanations with the k-nearest neighborhood classifier and uncertain data
- Localization in single facility location
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
- Determination of efficient solutions for point-objective locational decision problems
This page was built for publication: Some Properties of Location Problems with Block and Round Norms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3221721)
