From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems-Reference-Cited by-同舟云学术

From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems

Published:1998-08 Issue:4 Volume:46 Page:503-514
ISSN:0030-364X
Container-title:Operations Research
language:en
Short-container-title:Operations Research

Author:

Bertsimas Dimitris,Teo Chung-Piaw

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications

Link

https://pubsonline.informs.org/doi/pdf/10.1287/opre.46.4.503

Reference20 articles.

1. Arora S. , Lund C. , Motwani R. , Sudan M. , Szegedy M. Proof verification and hardness of approximation problemsProc. 33rd Annual Sympos. Foundation of Comput. Sci.(1992) 14 23

2. Cyclic Scheduling via Integer Programs with Circular Ones

3. A linear-time approximation algorithm for the weighted vertex cover problem

4. Bar-Yehuda R. , Geiger D. , Naor J. , Roth R. Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inferenceProc. 5th Annual ACM-SIAM Sympos. Discrete Algorithms(1994)

Cited by 31 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Network Design Problems;Algorithms and Combinatorics;2018

2. Netzwerk-Design-Probleme;Kombinatorische Optimierung;2018

3. Supermodular covering knapsack polytope;Discrete Optimization;2015-11

4. Nested Partitions for Large-Scale Optimization in Supply Chain Management;Industrial and Systems Engineering Series;2015-10-15

5. Primal-dual schema for capacitated covering problems;Mathematical Programming;2014-08-15