Approximation algorithm for the stochastic prize-collecting set multicover problem

DOI10.1016/J.ORL.2022.02.003OpenAlexW4212989190MaRDI QIDQ2670509

Yotaro Takazawa

Publication date: 11 March 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2022.02.003

zbMATH Keywords

stochastic programmingapproximation algorithmcrowdsourced deliveryset multicover problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Approximation algorithms for stochastic combinatorial optimization problems
• A unified approach to approximating partial covering problems
• Hedging uncertainty: approximation algorithms for stochastic optimization problems
• A Greedy Heuristic for the Set-Covering Problem
• Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data

This page was built for publication: Approximation algorithm for the stochastic prize-collecting set multicover problem