On covering location problems on networks with edge demand

DOI10.1016/j.cor.2015.04.005zbMath1349.90582OpenAlexW2024963330MaRDI QIDQ342492

Dmitry Krass, Jörg Kalcsics, Oded Berman

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.04.005

zbMATH Keywords

heuristicsfinite dominating setsnetworkscontinuous demandcovering problemsobnoxious

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study ⋮ Minmax regret maximal covering location problems with edge demands ⋮ Upgrading edges in the maximal covering location problem ⋮ Solving the 1-median problem on a network with continuous demand and demand surplus ⋮ Covering edges in networks ⋮ Multi-type maximal covering location problems: hybridizing discrete and continuous problems ⋮ Effects of multipurpose shopping trips on retail store location in a duopoly ⋮ Location of facility based on simulated annealing and ``ZKW algorithms

Cites Work

• Unnamed Item
• \((r|p)\)-centroid problems on networks with vertex and edge demand
• The minisum location problem on an undirected network with continuous link demands
• The multi-facility median problem with Pos/Neg weights on general graphs
• Designing emergency response networks for hazardous materials transportation
• A mixed integer linear program and tabu search approach for the complementary edge covering problem
• A new model for maximal coverage exploiting GIS capabilities
• Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree
• Solving the Huff-based competitive location model on a network with link-based demand
• On the (\(r|X_p\))-medianoid problem on a network with vertex and edge demands
• Covering models and optimization techniques for emergency response facility location and planning: a review
• The minimum weighted covering location problem with distance constraints
• Sequential location-allocation problems on chains and trees with probabilistic link demands
• An analysis of approximations for maximizing submodular set functions—I
• The expropriation location problem
• An aggregation approach to solving the networkp-median problem with link demands

This page was built for publication: On covering location problems on networks with edge demand