(r|p)-centroid problems on networks with vertex and edge demand
DOI10.1016/J.COR.2012.02.025zbMATH Open1349.90816OpenAlexW2042151987MaRDI QIDQ339626FDOQ339626
Authors: Dominik Kress, Erwin Pesch 
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.02.025
Recommendations
- \((r,p)\)-centroid problems on paths and trees
- On the (\(r|X_p\))-medianoid problem on a network with vertex and edge demands
- On covering location problems on networks with edge demand
- A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
- Improved algorithms for some competitive location centroid problems on paths, trees and graphs
Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Hierarchical games (including Stackelberg games) (91A65) Discrete location and assignment (90B80)
Cites Work
- Introduction to algorithms
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Title not available (Why is that?)
- Practical bilevel optimization. Algorithms and applications
- Foundations of bilevel programming
- Title not available (Why is that?)
- Competitive Location Models: A Framework and Bibliography
- On the use of genetic algorithms to solve location problems
- On locating new facilities in a competitive environment
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Maximum Coverage Location Problem
- Location analysis: a synthesis and survey
- Competitive Location on a Network
- Nearest common ancestors: a survey and a new algorithm for a distributed environment
- Sequential competitive location on networks
- Static competitive facility location: an overview of optimisation approaches.
- Sequential location problems
- Solving the Huff-based competitive location model on a network with link-based demand
- Algorithms for Voting and Competitive Location on a Network
- \((r,p)\)-centroid problems on paths and trees
- Networks with Condorcet solutions
- On the (\(r|X_p\))-medianoid problem on a network with vertex and edge demands
- Competitive location on a network
- Title not available (Why is that?)
- Finite Dominating Sets for Network Location Problems
Cited In (6)
- Competitive location and pricing on networks with random utilities
- Models and algorithms for competitive facility location problems with different customer behavior
- Bilevel programming and applications
- The generalized \(p\)-centdian on network
- On covering location problems on networks with edge demand
- On the (\(r|X_p\))-medianoid problem on a network with vertex and edge demands
This page was built for publication: \((r|p)\)-centroid problems on networks with vertex and edge demand
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339626)
