A generalization of the weighted set covering problem

DOI10.1002/NAV.10093MaRDI QIDQ4667822zbMATH OpenOpenAlexFDO

Authors Jian Yang, Joseph Y.-T. Leung

Publication date 21 April 2005

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

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

zbMATH Keywords

matchingsnetworks/graphssetsstochastic model applications

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2081030
• What is the best greedy-like heuristic for the weighted set covering problem?
• scientific article; zbMATH DE number 3863198
• A modified greedy heuristic for the set covering problem with improved worst case bound
• A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem

Cited in

(16)

• A modified greedy heuristic for the set covering problem with improved worst case bound
• What is the best greedy-like heuristic for the weighted set covering problem?
• Weighted geometric set cover with rectangles of bounded integer side lengths
• Approximation of the quadratic set covering problem
• Chance-constrained set covering with Wasserstein ambiguity
• The set cover problem with interval weights and the greedy algorithm for its solution
• Weighted geometric set multi-cover via quasi-uniform sampling
• scientific article; zbMATH DE number 3863198 (Why is no real title available?)
• scientific article; zbMATH DE number 3869064 (Why is no real title available?)
• On Partial Covers, Reducts and Decision Rules with Weights
• scientific article; zbMATH DE number 709680 (Why is no real title available?)
• scientific article; zbMATH DE number 1150277 (Why is no real title available?)
• scientific article; zbMATH DE number 6815827 (Why is no real title available?)
• Parameterized Weighted Containment
• Benders decomposition for set covering problems. Almost satisfying the consecutive ones property
• Static and dynamic source locations in undirected networks

Describes a project that uses

Uses Software

• CPLEX

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

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