Recommendations
- El conjunto eficiente en problemas de localizacion con normas mixtas (L p)
- Efficiency in constrained continuous location
- Efficiency in Euclidean constrained location problems
- scientific article; zbMATH DE number 3991290
- A polygonal upper bound for the efficient set for single-facility location problems with mixed norms
Cites work
- scientific article; zbMATH DE number 3828574 (Why is no real title available?)
- scientific article; zbMATH DE number 3291744 (Why is no real title available?)
- A computation procedure for the exact solution of location-allocation problems with rectangular distances
- Best n -Dimensional Approximation to Sets of Functions
- Convex Sets and Nearest Points. II
- Geometrical properties of the Fermat-Weber problem
- Location Theory, Dominance, and Convexity
- On Efficient Solutions to Multiple Objective Mathematical Programs
- Points minimaux et ensembles optimaux dans les espaces de Banach
- Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
- The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
Cited in
(37)- A characterization of efficient points in constrained location problems with regional demand
- A polygonal upper bound for the efficient set for single-facility location problems with mixed norms
- Restricted center problems under polyhedral gauges
- Localization in multifacility location theory
- scientific article; zbMATH DE number 4057301 (Why is no real title available?)
- Pareto optimization in topological vector spaces
- Multiple objective programming with piecewise linear functions
- Determination of efficient solutions for point-objective locational decision problems
- Relationships between constrained and unconstrained multi-objective optimization and application in location theory
- Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Polyhedral norms in an infinite dimensional space
- Bicriteria and restricted 2-facility Weber problems
- Hulls and Efficient Sets for the Rectilinear Norm
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- Efficiency for continuous facility location problems with attraction and repulsion
- Locating minimal sets using polyhedral cones
- Hamilton-Jacobi scaling limits of Pareto peeling in 2D
- Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
- Duality in vectorial control approximation problems with inequality restrictions
- On duality in the vectorial control-approximation problem
- scientific article; zbMATH DE number 1145345 (Why is no real title available?)
- Efficiency in constrained continuous location
- Weber problems with alternative transportation systems
- Dominating sets for convex functions with some applications
- Meilleure approximation en norme vectorielle et théorie de la localisation
- Efficiency in Euclidean constrained location problems
- Some personal views on the current state and the future of locational analysis
- Pareto envelopes in simple polygons
- Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
- Pareto efficient solutions in multi-objective optimization involving forbidden regions
- Determination of efficient points in multiple-objective location problems
- Weighting factor results in vector optimization
- A characterization theorem and an algorithm for a convex hull problem
- A new algorithm for solving planar multiobjective location problems involving the Manhattan norm
- Multiobjective control approximation problems: duality and optimality.
This page was built for publication: Sets of efficient points in a normed space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1084331)
