Geometric methods to solve max-ordering location problems
From MaRDI portal
Publication:1289016
DOI10.1016/S0166-218X(99)00005-0zbMATH Open0947.90105OpenAlexW4212998323MaRDI QIDQ1289016FDOQ1289016
Authors: Matthias Ehrgott, Horst W. Hamacher, S. Nickel 
Publication date: 8 November 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00005-0
Recommendations
Cites Work
- Robust discrete optimization and its applications
- Title not available (Why is that?)
- On the lexicographic minimax approach to location problems
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- On spanning tree problems with multiple objectives
- Finding the upper envelope of n line segments in O(n log n) time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equivalence of balance points and Pareto solutions in multiple-objective programming
- Multicriteria planar location problems
- Combinatorial algorithms for some 1-facility median problems in the plane
- Lexicographic quasiconcave multiobjective programming
- Multicriteria network location problems with sum objectives
- Note on combinatorial optimization with max-linear objective functions
Cited In (5)
- Geometric complexity of some location problems
- An algorithm for a multicriteria optimization problem and its application to a facility location problem
- An approximation algorithm for the facility location problem with lexicographic minimax objective
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
- Min-ordering and max-ordering scalarization methods for multi-objective robust optimization
This page was built for publication: Geometric methods to solve max-ordering location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1289016)
