scientific article; zbMATH DE number 1417899
From MaRDI portal
Publication:4944234
DOI<268::AID-MCDA252>3.0.CO;2-G 10.1002/(SICI)1099-1360(199909)8:5<268::AID-MCDA252>3.0.CO;2-GzbMath0944.90037MaRDI QIDQ4944234
Justo Puerto, Francisco Ramón Fernández García
Publication date: 19 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Decision theory (91B06) Continuous location (90B85) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)
Related Items (10)
Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study ⋮ Relationships between constrained and unconstrained multi-objective optimization and application in location theory ⋮ An exact completely positive programming formulation for the discrete ordered median problem: an extended version ⋮ A new algorithm for solving planar multiobjective location problems involving the Manhattan norm ⋮ The multiscenario lot size problem with concave costs. ⋮ Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets ⋮ A multi-criteria decision making approach for location planning for urban distribution centers under uncertainty ⋮ Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network ⋮ Multicriteria planar ordered median problems ⋮ Multiobjective solution of the uncapacitated plant location problem
Cites Work
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
- Geometrical properties of the Fermat-Weber problem
- Finding efficient solutions for rectilinear distance location problems efficiently
- Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
- Multicriteria planar location problems
- Sequential location problems
- A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem
- Efficiency in Euclidean constrained location problems
- Bicriteria and restricted 2-facility Weber problems
- Proper efficiency and the theory of vector maximization
- General models in min-max planar location: Checking optimality conditions
- Vector linear programming in zero-sum multicriteria matrix games
- Algorithms for Reporting and Counting Geometric Intersections
- Some Properties of Location Problems with Block and Round Norms
- Using Block Norms for Location Modeling
- Determination of efficient points in multiple-objective location problems
- Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
- Technical Note—Bounds in the Generalized Weber Problem under Locational Uncertainty
- Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method
- Sensitivity Analysis in Minisum Facility Location Problems
- Multicriteria network location problems with sum objectives
- Location Theory, Dominance, and Convexity
- Unnamed Item
This page was built for publication:
