Pages that link to "Item:Q1084331"
From MaRDI portal
The following pages link to Sets of efficient points in a normed space (Q1084331):
Displaying 31 items.
- Relationships between constrained and unconstrained multi-objective optimization and application in location theory (Q343815) (← links)
- Pareto optimization in topological vector spaces (Q705290) (← links)
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges (Q918867) (← links)
- Determination of efficient solutions for point-objective locational decision problems (Q920025) (← links)
- Efficiency for continuous facility location problems with attraction and repulsion (Q1026586) (← links)
- Weighting factor results in vector optimization (Q1093548) (← links)
- Localization in multifacility location theory (Q1095778) (← links)
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators (Q1198734) (← links)
- Weber problems with alternative transportation systems (Q1278584) (← links)
- Some personal views on the current state and the future of locational analysis (Q1291654) (← links)
- Efficiency in constrained continuous location (Q1291655) (← links)
- Restricted center problems under polyhedral gauges (Q1291660) (← links)
- Polyhedral norms in an infinite dimensional space (Q1316313) (← links)
- Bicriteria and restricted 2-facility Weber problems (Q1362675) (← links)
- Dominating sets for convex functions with some applications (Q1389077) (← links)
- Multiobjective control approximation problems: duality and optimality. (Q1584032) (← links)
- A new algorithm for solving planar multiobjective location problems involving the Manhattan norm (Q1698881) (← links)
- A polygonal upper bound for the efficient set for single-facility location problems with mixed norms (Q1804560) (← links)
- Planar point-objecitve location problems with nonconvex constraints: A geometrical construction (Q1890946) (← links)
- A characterization theorem and an algorithm for a convex hull problem (Q2341220) (← links)
- Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm (Q2429332) (← links)
- Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets (Q2456634) (← links)
- A characterization of efficient points in constrained location problems with regional demand (Q2564626) (← links)
- PARETO ENVELOPES IN SIMPLE POLYGONS (Q3070044) (← links)
- Duality in vectorial control approximation problems with inequality restrictions (Q3363097) (← links)
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges (Q3783052) (← links)
- Meilleure approximation en norme vectorielle et théorie de la localisation (Q3794670) (← links)
- On duality in the vectorial control-approximation problem (Q3978455) (← links)
- Multiple objective programming with piecewise linear functions (Q4516915) (← links)
- (Q5158546) (← links)
- Hamilton-Jacobi scaling limits of Pareto peeling in 2D (Q6145689) (← links)