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

Cutting plane algorithms for 0-1 programming based on cardinality cuts

Author

Listed:
  • Oguz, Osman

Abstract

We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by their revision and use in integer programming as a new generation of cuts that excludes not only portions of polyhedra containing noninteger points, also parts with some integer points that have been explored in search of an optimal solution. Our computational experimentations demonstrate that this new approach has significant potential for solving large scale integer programming problems.

Suggested Citation

  • Oguz, Osman, 2010. "Cutting plane algorithms for 0-1 programming based on cardinality cuts," European Journal of Operational Research, Elsevier, vol. 205(2), pages 273-279, September.
    • Handle: RePEc:eee:ejores:v:205:y:2010:i:2:p:273-279
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00014-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Zonghao Gu & George L. Nemhauser & Martin W. P. Savelsbergh, 1999. "Lifted Cover Inequalities for 0-1 Integer Programs: Complexity," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 117-123, February.
    2. Ellis L. Johnson & George L. Nemhauser & Martin W.P. Savelsbergh, 2000. "Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 2-23, February.
    3. Gérard Cornuéjols & Milind Dawande, 1999. "A Class of Hard Small 0-1 Programs," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 205-210, May.
    Full references (including those not matched with items on IDEAS)

    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. Lee, L. H. & Chew, E. P. & Ng, T. S., 2005. "Production planning with approved vendor matrices for a hard-disk drive manufacturer," European Journal of Operational Research, Elsevier, vol. 162(2), pages 310-324, April.
    2. Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
    3. Ali, Agha Iqbal & O'Connor, Debra J., 2010. "The impact of distribution system characteristics on computational tractability," European Journal of Operational Research, Elsevier, vol. 200(2), pages 323-333, January.
    4. Jooken, Jorik & Leyman, Pieter & De Causmaecker, Patrick, 2023. "Features for the 0-1 knapsack problem based on inclusionwise maximal solutions," European Journal of Operational Research, Elsevier, vol. 311(1), pages 36-55.
    5. Armin Fügenschuh & Henning Homfeld & Hanno Schülldorf, 2015. "Single-Car Routing in Rail Freight Transport," Transportation Science, INFORMS, vol. 49(1), pages 130-148, February.
    6. Tsai, Jung-Fa & Lin, Ming-Hua & Hu, Yi-Chung, 2008. "Finding multiple solutions to general integer linear programs," European Journal of Operational Research, Elsevier, vol. 184(2), pages 802-809, January.
    7. Domenech, B & Lusa, A, 2016. "A MILP model for the teacher assignment problem considering teachers’ preferences," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1153-1160.
    8. Alper Atamtürk & Laurent Flindt Muller & David Pisinger, 2013. "Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 420-431, August.
    9. Karen Aardal & Arjen K. Lenstra, 2004. "Hard Equality Constrained Integer Knapsacks," Mathematics of Operations Research, INFORMS, vol. 29(3), pages 724-738, August.
    10. Nwana, V. & Darby-Dowman, K. & Mitra, G., 2005. "A co-operative parallel heuristic for mixed zero-one linear programming: Combining simulated annealing with branch and bound," European Journal of Operational Research, Elsevier, vol. 164(1), pages 12-23, July.
    11. Alper Atamtürk & Martin Savelsbergh, 2005. "Integer-Programming Software Systems," Annals of Operations Research, Springer, vol. 140(1), pages 67-124, November.
    12. Diego Klabjan & George L. Nemhauser, 2002. "A Polyhedral Study of Integer Variable Upper Bounds," Mathematics of Operations Research, INFORMS, vol. 27(4), pages 711-739, November.
    13. Daniel Dadush & Santanu S. Dey & Juan Pablo Vielma, 2011. "The Chvátal-Gomory Closure of a Strictly Convex Body," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 227-239, May.
    14. Roberto Roberti & Enrico Bartolini & Aristide Mingozzi, 2015. "The Fixed Charge Transportation Problem: An Exact Algorithm Based on a New Integer Programming Formulation," Management Science, INFORMS, vol. 61(6), pages 1275-1291, June.
    15. Heiko Vogel, 2012. "Solving market split problems with heuristical lattice reduction," Annals of Operations Research, Springer, vol. 196(1), pages 581-590, July.
    16. Panton, David & John, Maria & Lucas, Stephen & Mason, Andrew, 2003. "Flight test data cycle map optimisation," European Journal of Operational Research, Elsevier, vol. 146(3), pages 486-497, May.
    17. Yongjia Song & James R. Luedtke & Simge Küçükyavuz, 2014. "Chance-Constrained Binary Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 735-747, November.
    18. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar & Mohammad Hassan Sharifitabar, 2015. "A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 48-58, February.
    19. Ha, Chunghun & Kuo, Way, 2006. "Reliability redundancy allocation: An improved realization for nonconvex nonlinear programming problems," European Journal of Operational Research, Elsevier, vol. 171(1), pages 24-38, May.
    20. Guglielmo Lulli & Suvrajeet Sen, 2004. "A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems," Management Science, INFORMS, vol. 50(6), pages 786-796, June.

    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:205:y:2010:i:2:p:273-279. 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.