Recoverable robust prize-collecting call control problem

DOI10.7540/J.YNU.20180790MaRDI QIDQ5210120zbMATH OpenFDO

Authors Yan Huang, Jianping Li

Publication date 22 January 2020

Full work available at URL https://doi.org/10.7540/J.YNU.20180790

zbMATH Keywords

approximation algorithmcall controldynamic programming algorithmfully polynomial time approximation schemerecoverable robustness

Mathematics Subject Classification ID

Dynamic programming (90C39) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The prize-collecting call control problem on weighted lines and rings
• Recoverable robust knapsacks: -scenarios
• The recoverable robust spanning tree problem with interval costs is polynomially solvable
• Recoverable Robust Combinatorial Optimization Problems
• Recoverable robust shortest path problems

Cited in

(2)

• A linear time algorithm for the robust recoverable selection problem
• The prize-collecting call control problem on weighted lines and rings

This page was built for publication: Recoverable robust prize-collecting call control problem

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