Geometric methods to solve max-ordering location problems

DOI10.1016/S0166-218X(99)00005-0MaRDI QIDQ1289016zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

lexicographic and Pareto locationsmax-ordering locations

Mathematics Subject Classification ID

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

Recommendations

• Multicriteria planar location problems
• Multicriteria planar ordered median problems
• QUADRATIC ORDERED MEDIAN LOCATION PROBLEMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• A flexible approach to location problems

Cites work

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

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)