(r|p)-centroid problems on networks with vertex and edge demand

DOI10.1016/J.COR.2012.02.025MaRDI QIDQ339626zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

bilevel programmingcentroidcompetitive locationedge demandlocation

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Programming involving graphs or networks (90C35) Hierarchical games (including Stackelberg games) (91A65) Social networks; opinion dynamics (91D30)

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

Cites work

• \((r,p)\)-centroid problems on paths and trees
• Algorithms for Voting and Competitive Location on a Network
• Competitive Location Models: A Framework and Bibliography
• Competitive location on a network
• Competitive Location on a Network
• Finite Dominating Sets for Network Location Problems
• Foundations of bilevel programming
• scientific article; zbMATH DE number 3839870 (Why is no real title available?)
• scientific article; zbMATH DE number 9247 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1253066 (Why is no real title available?)
• scientific article; zbMATH DE number 7005721 (Why is no real title available?)
• Introduction to algorithms
• Location analysis: a synthesis and survey
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Nearest common ancestors: a survey and a new algorithm for a distributed environment
• Networks with Condorcet solutions
• On locating new facilities in a competitive environment
• On the (\(r|X_p\))-medianoid problem on a network with vertex and edge demands
• On the use of genetic algorithms to solve location problems
• Practical bilevel optimization. Algorithms and applications
• Sequential competitive location on networks
• Sequential location problems
• Solving the Huff-based competitive location model on a network with link-based demand
• Static competitive facility location: an overview of optimisation approaches.
• The Maximum Coverage Location Problem

Cited in

(6)

• Bilevel programming and applications
• On the (\(r|X_p\))-medianoid problem on a network with vertex and edge demands
• Competitive location and pricing on networks with random utilities
• Models and algorithms for competitive facility location problems with different customer behavior
• On covering location problems on networks with edge demand
• The generalized \(p\)-centdian on network

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)