Publication:4526867
From MaRDI portal
DOI<581::AID-NAV3>3.0.CO;2-R 10.1002/1520-6750(200010)47:7<581::AID-NAV3>3.0.CO;2-RzbMath0991.90082MaRDI QIDQ4526867
Publication date: 31 January 2001
90C47: Minimax problems in mathematical programming
90C29: Multi-objective and goal programming
90B80: Discrete location and assignment
65Y20: Complexity and performance of numerical algorithms
Related Items
The multicriteria big cube small cube method, Planar expropriation problem with non-rigid rectangular facilities, An interactive solution approach for a bi-objective semi-desirable location problem, Low complexity algorithms for optimal consumer push-pull partial covering in the plane, Efficiency for continuous facility location problems with attraction and repulsion, Dispersion with connectivity in wireless mesh networks, Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives, Locating a semi-obnoxious covering facility with repelling polygonal regions, Fuzzy facility location problem with preference of candidate sites, Euclidean push--pull partial covering problems
Cites Work
- Analytical models for locating undesirable facilities
- Multicriteria planar location problems
- Locational optimization problems solved through Voronoi diagrams
- A geometrical solution for quadratic bicriteria location models
- Proper efficiency and the theory of vector maximization
- Multiobjective analysis of facility location decisions
- Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
- Degree of locational freedom in a single facility euclidean minimax location model
- Multicriteria network location problems with sum objectives
