Geometric methods to solve max-ordering location problems

DOI10.1016/S0166-218X(99)00005-0zbMath0947.90105OpenAlexW4212998323MaRDI QIDQ1289016

Matthias Ehrgott, Horst W. Hamacher, Stefan 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

zbMATH Keywords

lexicographic and Pareto locationsmax-ordering locations

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Discrete location and assignment (90B80)

Related Items (4)

Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach ⋮ Unnamed Item ⋮ Min-ordering and max-ordering scalarization methods for multi-objective robust optimization ⋮ An approximation algorithm for the facility location problem with lexicographic minimax objective

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• On the lexicographic minimax approach to location problems
• Multicriteria planar location problems
• On spanning tree problems with multiple objectives
• Combinatorial algorithms for some 1-facility median problems in the plane
• Robust discrete optimization and its applications
• Equivalence of balance points and Pareto solutions in multiple-objective programming
• Note on combinatorial optimization with max-linear objective functions
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Lexicographic quasiconcave multiobjective programming
• Multicriteria network location problems with sum objectives

This page was built for publication: Geometric methods to solve max-ordering location problems