IDEAS home Printed from https://ideas.repec.org/p/mit/sloanp/2521.html
   My bibliography  Save this paper

From valid inequalities to heuristics : a unified view of primal-dual approximation algortithms [sic] in covering problems

Author

Listed:
  • Bertsimas, Dimitris
  • Teo, Chungpiaw.

Abstract

Includes bibliographical references (p. 26-27).

Suggested Citation

  • Bertsimas, Dimitris & Teo, Chungpiaw., 1994. "From valid inequalities to heuristics : a unified view of primal-dual approximation algortithms [sic] in covering problems," Working papers 3707-94., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    • Handle: RePEc:mit:sloanp:2521
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/1721.1/2521
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Gregory Dobson, 1982. "Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data," Mathematics of Operations Research, INFORMS, vol. 7(4), pages 515-531, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bertsimas, Dimitris. & Niño-Mora, Jose., 1994. "Restless bandit, linear programming relaxations and a primal-dual heuristic," Working papers 3727-94., Massachusetts Institute of Technology (MIT), Sloan School of Management.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jakob Puchinger & Günther R. Raidl & Ulrich Pferschy, 2010. "The Multidimensional Knapsack Problem: Structure and Algorithms," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 250-265, May.
    2. Piotr Berman & Bhaskar DasGupta & Lakshmi Kaligounder & Marek Karpinski, 2011. "On the Computational Complexity of Measuring Global Stability of Banking Networks," Papers 1110.3546, arXiv.org, revised Mar 2013.
    3. Tobias Harks & Felix G. König & Jannik Matuschke & Alexander T. Richter & Jens Schulz, 2016. "An Integrated Approach to Tactical Transportation Planning in Logistics Networks," Transportation Science, INFORMS, vol. 50(2), pages 439-460, May.
    4. Ruslan Sadykov & François Vanderbeck & Artur Pessoa & Issam Tahiri & Eduardo Uchoa, 2019. "Primal Heuristics for Branch and Price: The Assets of Diving Methods," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 251-267, April.
    5. Chandra Chekuri & Tanmay Inamdar & Kent Quanrud & Kasturi Varadarajan & Zhao Zhang, 2022. "Algorithms for covering multiple submodular constraints and applications," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 979-1010, September.
    6. Yishuo Shi & Yingli Ran & Zhao Zhang & James Willson & Guangmo Tong & Ding-Zhu Du, 2019. "Approximation algorithm for the partial set multi-cover problem," Journal of Global Optimization, Springer, vol. 75(4), pages 1133-1146, December.
    7. Wishon, Christopher & Villalobos, J. Rene, 2016. "Robust efficiency measures for linear knapsack problem variants," European Journal of Operational Research, Elsevier, vol. 254(2), pages 398-409.
    8. Yingli Ran & Zhao Zhang & Hongwei Du & Yuqing Zhu, 2017. "Approximation algorithm for partial positive influence problem in social network," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 791-802, February.
    9. Sabah Bushaj & İ. Esra Büyüktahtakın, 2024. "A K-means Supported Reinforcement Learning Framework to Multi-dimensional Knapsack," Journal of Global Optimization, Springer, vol. 89(3), pages 655-685, July.
    10. Arnaud Fréville & SaÏd Hanafi, 2005. "The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects," Annals of Operations Research, Springer, vol. 139(1), pages 195-227, October.
    11. Yingli Ran & Yishuo Shi & Zhao Zhang, 2017. "Local ratio method on partial set multi-cover," Journal of Combinatorial Optimization, Springer, vol. 34(1), pages 302-313, July.
    12. Walter, Rico & Lawrinenko, Alexander, 2017. "Lower bounds and algorithms for the minimum cardinality bin covering problem," European Journal of Operational Research, Elsevier, vol. 256(2), pages 392-403.
    13. Abbass Gorgi & Mourad El Ouali & Anand Srivastav & Mohamed Hachimi, 2021. "Approximation algorithm for the multicovering problem," Journal of Combinatorial Optimization, Springer, vol. 41(2), pages 433-450, February.

    More about this item

    Keywords

    HD28 .M414 no.3707-; 94;

    JEL classification:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:mit:sloanp:2521. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: None (email available below). General contact details of provider: https://edirc.repec.org/data/ssmitus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.