Exact algorithms for handling outliers in center location problems on networks using k-max functions

DOI10.1016/J.EJOR.2018.08.030MaRDI QIDQ1622795zbMATH OpenOpenAlexWikidataFDO

Authors Teresa Schnepper, Kathrin Klamroth, Michael Stiglmayr, Justo Puerto

Publication date 19 November 2018

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2018.08.030

zbMATH Keywords

outlierlocation theorycenter problemfinite dominating set\(k\)-max function

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• Algorithms for facility location problems with outliers. (Extended abstract)
• An approximation algorithm for the k-level facility location problem with outliers
• Constant Factor Approximation for Capacitated k-Center with Outliers
• Approximation algorithms for the individually fair \(k\)-center with outliers
• Large-scale distributed algorithms for facility location with outliers
• \(k\)-center of network location problem based on improved algorithm
• An approximation algorithm for the dynamic facility location problem with outliers
• Improved algorithms to network \(p\)-center location problems
• scientific article; zbMATH DE number 177560

Cites work

• scientific article; zbMATH DE number 1323024 (Why is no real title available?)
• scientific article; zbMATH DE number 1394671 (Why is no real title available?)
• A flexible approach to location problems
• A streaming algorithm for 2-center with outliers in high dimensions
• Algorithmic results for ordered median problems
• Algorithms for Reporting and Counting Geometric Intersections
• Algorithms for facility location problems with outliers. (Extended abstract)
• Algorithms for optimal outlier removal
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
• An improved approximation algorithm for uncapacitated facility location problem with penalties
• Combinatorial approximation algorithms for the robust facility location problem with penalties
• Covering points by disjoint boxes with outliers
• Distribution systems design with role dependent objectives
• Generalized multiple objective bottleneck problems
• Lexicographic balanced optimization problems
• Locating hyperplanes to fitting set of points: a general framework
• Locating lines and hyperplanes. Theory and algorithms
• Location theory. A unified approach
• Minimax regret single-facility ordered median location problems on networks
• Minimizing ordered weighted averaging of rational functions with applications to continuous location
• Multicriteria 0-1 knapsack problems with \(k\)-min objectives
• Multicriteria planar ordered median problems
• Multifacility ordered median problems on networks: A further analysis
• New Results on the Complexity of p-Centre Problems
• On k-Max-optimization
• On discrete optimization with ordering
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking
• On the exponential cardinality of FDS for the ordered p-median problem
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Single-allocation ordered median hub location problems
• The \(p\)-facility ordered median problem on networks
• The non-uniform \(k\)-center problem
• The ordered capacitated facility location problem
• Variants of shortest path problems

Cited in

(3)

• Covering problems with polyellipsoids: a location analysis perspective
• A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks
• Constant Factor Approximation for Capacitated k-Center with Outliers

This page was built for publication: Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1622795)