A generalization of the weighted set covering problem

DOI10.1002/nav.10093zbMath1104.90011OpenAlexW2061129250MaRDI QIDQ4667822

Jian Yang, Joseph Y.-T. Leung

Publication date: 21 April 2005

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.10093

zbMATH Keywords

setsmatchingsstochastic model applicationsnetworks/graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Stochastic models in economics (91B70) Deterministic network models in operations research (90B10)

Related Items (3)

Static and dynamic source locations in undirected networks ⋮ Chance-constrained set covering with Wasserstein ambiguity ⋮ Benders decomposition for set covering problems. Almost satisfying the consecutive ones property

Uses Software

• CPLEX

This page was built for publication: A generalization of the weighted set covering problem