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

DOI10.1016/J.EJOR.2018.08.030zbMATH Open1403.90489OpenAlexW2888424924WikidataQ58217106 ScholiaQ58217106MaRDI QIDQ1622795FDOQ1622795

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

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

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)

Cites Work

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

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)