A local analysis to determine all optimal solutions of p-k- location problems on networks

DOI10.1016/J.DAM.2020.05.013MaRDI QIDQ2664012zbMATH OpenOpenAlexFDO

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

Publication date 20 April 2021

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2020.05.013

zbMATH Keywords

\(k\)-\(\max\) functioncenter problem on networkscomplete optimal setlocal analysisoutliersecondary objective

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Programming involving graphs or networks (90C35)

Recommendations

• Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions
• The \(p\) maximal cover -- \(p\) partial center problem on networks
• scientific article; zbMATH DE number 849075
• The discrete p-maxian location problem
• Dominant, an algorithm for the \(p\)-center problem.

Cites work

• Algorithms for facility location problems with outliers. (Extended abstract)
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
• Combinatorial approximation algorithms for the robust facility location problem with penalties
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Covering points by disjoint boxes with outliers
• Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions
• Finding multiple solutions to general integer linear programs
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 1394671 (Why is no real title available?)
• Lexicographic balanced optimization problems
• Lexicographic bottleneck combinatorial problems
• Lexicographic bottleneck problems
• Location theory. A unified approach
• Multicriteria Optimization
• Multifacility ordered median problems on networks: A further analysis
• On k-Max-optimization
• On minquantile and maxcovering optimisation
• Optimization over the efficient set: overview
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
• The m-Center Problem
• The multi-facility median problem with Pos/Neg weights on general graphs
• The multicriteria \(p\)-facility median location problem on networks
• The non-uniform k-center problem
• Variants of shortest path problems

Cited in

(3)

• Multi-objective matroid optimization with ordinal weights
• Biobjective optimization problems on matroids with binary costs
• On worst-case aggregation analysis for network location problems

This page was built for publication: A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks

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