A polygonal upper bound for the efficient set for single-facility location problems with mixed norms
From MaRDI portal
(Redirected from Publication:1804560)
Recommendations
- El conjunto eficiente en problemas de localizacion con normas mixtas (L p)
- Some Properties of Location Problems with Block and Round Norms
- Sets of efficient points in a normed space
- Determination of efficient points in multiple-objective location problems
- A characterization of efficient points in constrained location problems with regional demand
Cites work
- scientific article; zbMATH DE number 3833719 (Why is no real title available?)
- Determination of efficient points in multiple-objective location problems
- Determination of efficient solutions for point-objective locational decision problems
- El conjunto eficiente en problemas de localizacion con normas mixtas (L p)
- Localization in single facility location
- Location Theory, Dominance, and Convexity
- Sets of efficient points in a normed space
- Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
Cited in
(8)- Some Properties of Location Problems with Block and Round Norms
- Determination of efficient points in multiple-objective location problems
- An interior-point method for the single-facility location problem with mixed norms using a conic formulation
- Localization in multifacility location theory
- Hulls and Efficient Sets for the Rectilinear Norm
- Location problems with different norms for different points
- Sets of efficient points in a normed space
- Efficiency in Euclidean constrained location problems
This page was built for publication: A polygonal upper bound for the efficient set for single-facility location problems with mixed norms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804560)
