Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets
From MaRDI portal
Publication:2456634
DOI10.1016/j.cor.2006.05.002zbMath1278.90220OpenAlexW2134257358WikidataQ58217272 ScholiaQ58217272MaRDI QIDQ2456634
Justo Puerto, Antonio M. Rodríguez-Chía
Publication date: 19 October 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10498/7230
Related Items
Relationships between constrained and unconstrained multi-objective optimization and application in location theory, Multiple criteria facility location problems: a survey, On the structure of the weakly efficient set for quasiconvex vector minimization, Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Localization in single facility location
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
- Sets of efficient points in a normed space
- Multi-criteria analysis with partial information about the weighting coefficients
- Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
- Multicriteria planar location problems
- A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem
- Efficiency in constrained continuous location
- A geometrical solution for quadratic bicriteria location models
- Efficiency in Euclidean constrained location problems
- On the number of criteria needed to decide Pareto optimality
- Geometrical description of the weakly efficient solution set for multicriteria location problems
- Multiple criteria decision analysis. State of the art surveys
- Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
- A characterization of efficient points in constrained location problems with regional demand
- Geometrical characterization of weakly efficient points
- Multicriteria planar ordered median problems
- Determination of efficient points in multiple-objective location problems
- Structure of Efficient Sets for Convex Objectives
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
- Simpson Points in Planar Problems with Locational Constraints. The Round-Norm Case
- Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case
- Location Theory, Dominance, and Convexity
