Cooperative covering problems on networks

DOI10.1002/NET.21549MaRDI QIDQ4642483zbMATH OpenOpenAlexFDO

Authors Igor Averbakh, Dmitry Krass, Jörg Kalcsics, S. Nickel, 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

networkscovering problemsfinite dominating setscooperativeinteger programming formulations

Mathematics Subject Classification ID

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

Recommendations

• Cooperative cover of uniform demand
• Generalized coverage: new developments in covering location models
• Covering part of a planar network
• The maximin gradual cover location problem
• scientific article; zbMATH DE number 9246

Cited in

(11)

• Spider covers for prize-collecting network activation problem
• Location of facility based on simulated annealing and ``ZKW algorithms
• Cooperative cover of uniform demand
• Covering part of a planar network
• Upgrading edges in the maximal covering location problem
• Generalized coverage: new developments in covering location models
• The minimal covering location and sizing problem in the presence of gradual cooperative coverage
• \(p\)-facility Huff location problem on networks
• Facility location problems with user cooperation
• A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover
• Discrete cooperative coverage location models with alternative facility types in a probabilistic setting

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

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