IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v227y2013i3p409-422.html
   My bibliography  Save this article

Packing and covering with linear programming: A survey

Author

Listed:
  • Bentz, Cédric
  • Cornaz, Denis
  • Ries, Bernard

Abstract

This paper considers the polyhedral results and the min–max results on packing and covering problems of the decade. Since the strong perfect graph theorem (published in 2006), the main such results are available for the packing problem, however there are still important polyhedral questions that remain open. For the covering problem, the main questions are still open, although there has been important progress. We survey some of the main results with emphasis on those where linear programming and graph theory come together. They mainly concern the covering of cycles or dicycles in graphs or signed graphs, either with vertices or edges; this includes the multicut and integral multiflow problems.

Suggested Citation

  • Bentz, Cédric & Cornaz, Denis & Ries, Bernard, 2013. "Packing and covering with linear programming: A survey," European Journal of Operational Research, Elsevier, vol. 227(3), pages 409-422.
    • Handle: RePEc:eee:ejores:v:227:y:2013:i:3:p:409-422
    DOI: 10.1016/j.ejor.2012.11.045
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712008971
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2012.11.045?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. John J. Bartholdi & James B. Orlin & H. Donald Ratliff, 1980. "Cyclic Scheduling via Integer Programs with Circular Ones," Operations Research, INFORMS, vol. 28(5), pages 1074-1085, October.
    2. Bentz, Cédric & Costa, Marie-Christine & Létocart, Lucas & Roupin, Frédéric, 2009. "Multicuts and integral multiflows in rings," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1251-1254, August.
    3. Costa, Marie-Christine & Letocart, Lucas & Roupin, Frederic, 2005. "Minimal multicut and maximal integer multiflow: A survey," European Journal of Operational Research, Elsevier, vol. 162(1), pages 55-69, April.
    4. Xujin Chen & Zhibin Chen & Wenan Zang, 2010. "A Unified Approach to Box-Mengerian Hypergraphs," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 655-668, August.
    5. Conforti, Michele & Cornuejols, Gerard & Kapoor, Ajai & Vuskovic, Kristina, 2001. "Perfect, ideal and balanced matrices," European Journal of Operational Research, Elsevier, vol. 133(3), pages 455-461, September.
    6. Alberto Caprara & Paolo Toth & Matteo Fischetti, 2000. "Algorithms for the Set Covering Problem," Annals of Operations Research, Springer, vol. 98(1), pages 353-371, December.
    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. Subrata Mitra & Balram Avittathur, 2018. "Application of linear programming in optimizing the procurement and movement of coal for an Indian coal-fired power-generating company," DECISION: Official Journal of the Indian Institute of Management Calcutta, Springer;Indian Institute of Management Calcutta, vol. 45(3), pages 207-224, September.

    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. Bentz, Cédric & Costa, Marie-Christine & Létocart, Lucas & Roupin, Frédéric, 2009. "Multicuts and integral multiflows in rings," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1251-1254, August.
    2. Aykin, Turgut, 2000. "A comparative evaluation of modeling approaches to the labor shift scheduling problem," European Journal of Operational Research, Elsevier, vol. 125(2), pages 381-397, September.
    3. R. Baldacci & E. Hadjiconstantinou & A. Mingozzi, 2004. "An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation," Operations Research, INFORMS, vol. 52(5), pages 723-738, October.
    4. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    5. Alireza Amirteimoori & Simin Masrouri, 2021. "DEA-based competition strategy in the presence of undesirable products: An application to paper mills," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 31(2), pages 5-21.
    6. Patrizia Beraldi & Andrzej Ruszczyński, 2002. "The Probabilistic Set-Covering Problem," Operations Research, INFORMS, vol. 50(6), pages 956-967, December.
    7. Michael J. Brusco & Larry W. Jacobs, 2000. "Optimal Models for Meal-Break and Start-Time Flexibility in Continuous Tour Scheduling," Management Science, INFORMS, vol. 46(12), pages 1630-1641, December.
    8. Elizabeth Baldwin & Paul Klemperer, 2019. "Understanding Preferences: “Demand Types”, and the Existence of Equilibrium With Indivisibilities," Econometrica, Econometric Society, vol. 87(3), pages 867-932, May.
    9. Jee Eun Kang & Will Recker, 2015. "Strategic Hydrogen Refueling Station Locations with Scheduling and Routing Considerations of Individual Vehicles," Transportation Science, INFORMS, vol. 49(4), pages 767-783, November.
    10. Otto, Alena & Tilk, Christian, 2024. "Intelligent design of sensor networks for data-driven sensor maintenance at railways," Omega, Elsevier, vol. 127(C).
    11. Jacob R. Fooks & Kent D. Messer & Maik Kecinski, 2018. "A Cautionary Note on the Use of Benefit Metrics for Cost-Effective Conservation," Environmental & Resource Economics, Springer;European Association of Environmental and Resource Economists, vol. 71(4), pages 985-999, December.
    12. Guan, Xiucui & Zhang, Jianzhong, 2007. "Improving multicut in directed trees by upgrading nodes," European Journal of Operational Research, Elsevier, vol. 183(3), pages 971-980, December.
    13. Delorme, Xavier & Dolgui, Alexandre & Kovalev, Sergey & Kovalyov, Mikhail Y., 2019. "Minimizing the number of workers in a paced mixed-model assembly line," European Journal of Operational Research, Elsevier, vol. 272(1), pages 188-194.
    14. Owais, Mahmoud & Moussa, Ghada S. & Hussain, Khaled F., 2019. "Sensor location model for O/D estimation: Multi-criteria meta-heuristics approach," Operations Research Perspectives, Elsevier, vol. 6(C).
    15. Nguyen, Tri-Dung, 2014. "A fast approximation algorithm for solving the complete set packing problem," European Journal of Operational Research, Elsevier, vol. 237(1), pages 62-70.
    16. Yann Ferrand & Michael Magazine & Uday S. Rao & Todd F. Glass, 2011. "Building Cyclic Schedules for Emergency Department Physicians," Interfaces, INFORMS, vol. 41(6), pages 521-533, December.
    17. Tristan Becker & Maximilian Schiffer & Grit Walther, 2022. "A General Branch-and-Cut Framework for Rotating Workforce Scheduling," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1548-1564, May.
    18. Michael J. Brusco & Larry W. Jacobs, 1998. "Personnel Tour Scheduling When Starting-Time Restrictions Are Present," Management Science, INFORMS, vol. 44(4), pages 534-547, April.
    19. Reuven Cohen & Mira Gonen, 2019. "On interval and circular-arc covering problems," Annals of Operations Research, Springer, vol. 275(2), pages 281-295, April.
    20. Tristan Becker, 2020. "A decomposition heuristic for rotational workforce scheduling," Journal of Scheduling, Springer, vol. 23(5), pages 539-554, October.

    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:eee:ejores:v:227:y:2013:i:3:p:409-422. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.