Determination of efficient points in multiple-objective location problems
From MaRDI portal
Publication:3815098
DOI10.1002/1520-6750(198812)35:6%3C697::AID-NAV3220350613%3E3.0.CO;2-8zbMATH Open0663.90023OpenAlexW1967430357MaRDI QIDQ3815098FDOQ3815098
Authors: B. Pelegrin, Francisco Ramón Fernández García 
Publication date: 1988
Full work available at URL: https://doi.org/10.1002/1520-6750(198812)35:6%3C697::aid-nav3220350613%3E3.0.co;2-8
Recommendations
- Determination of efficient solutions for point-objective locational decision problems
- El conjunto eficiente en problemas de localizacion con normas mixtas (L p)
- Efficient solutions of multicriteria location problems with rectilinear norm
- A polygonal upper bound for the efficient set for single-facility location problems with mixed norms
- Sets of efficient points in a normed space
Management decision making, including multiple objectives (90B50) Inventory, storage, reservoirs (90B05)
Cited In (24)
- Multiobjective analysis of facility location decisions
- An efficient method for calculating the minimum distance from an operating point to a specific (hyperbolic) efficient frontier
- El conjunto eficiente en problemas de localizacion con normas mixtas (L p)
- Hamilton-Jacobi scaling limits of Pareto peeling in 2D
- Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets
- Multiobjective control approximation problems: duality and optimality.
- Title not available (Why is that?)
- A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem
- Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study
- Bicriteria and restricted 2-facility Weber problems
- On the multisource hyperplanes location problem to fitting set of points
- Multiobjective solution of the uncapacitated plant location problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiple objective programming with piecewise linear functions
- Relationships between constrained and unconstrained multi-objective optimization and application in location theory
- A polygonal upper bound for the efficient set for single-facility location problems with mixed norms
- Determination of efficient solutions for point-objective locational decision problems
- Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
- Pareto envelopes in simple polygons
- Efficiency in constrained continuous location
- Title not available (Why is that?)
- A new algorithm for solving planar multiobjective location problems involving the Manhattan norm
- Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
This page was built for publication: Determination of efficient points in multiple-objective location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3815098)
