Cooperative covering problems on networks

DOI10.1002/net.21549zbMath1390.90366OpenAlexW2107686563MaRDI QIDQ4642483

Stefan Nickel, Jörg Kalcsics, Dmitry Krass, Igor Averbakh, Oded Berman

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21549

zbMATH Keywords

finite dominating setsnetworkscooperativecovering problemsinteger programming formulations

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (6)

\(p\)-facility Huff location problem on networks ⋮ A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover ⋮ Upgrading edges in the maximal covering location problem ⋮ The minimal covering location and sizing problem in the presence of gradual cooperative coverage ⋮ Location of facility based on simulated annealing and ``ZKW algorithms ⋮ Cooperative cover of uniform demand

This page was built for publication: Cooperative covering problems on networks