IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v5y2001i3d10.1023_a1011493126498.html
   My bibliography  Save this article

On Disjunctive Cuts for Combinatorial Optimization

Author

Listed:
  • Adam N. Letchford

    (Lancaster University)

Abstract

In the successful branch-and-cut approach to combinatorial optimization, linear inequalities are used as cutting planes within a branch-and-bound framework. Although researchers often prefer to use facet-inducing inequalities as cutting planes, good computational results have recently been obtained using disjunctive cuts, which are not guaranteed to be facet-inducing in general. A partial explanation for the success of the disjunctive cuts is given in this paper. It is shown that, for six important combinatorial optimization problems (the clique partitioning, max-cut, acyclic subdigraph, linear ordering, asymmetric travelling salesman and set covering problems), certain facet-inducing inequalities can be obtained by simple disjunctive techniques. New polynomial-time separation algorithms are obtained for these inequalities as a by-product. The disjunctive approach is then compared and contrasted with some other ‘general-purpose’ frameworks for generating cutting planes and some conclusions are made with respect to the potential and limitations of the disjunctive approach.

Suggested Citation

  • Adam N. Letchford, 2001. "On Disjunctive Cuts for Combinatorial Optimization," Journal of Combinatorial Optimization, Springer, vol. 5(3), pages 299-315, September.
    • Handle: RePEc:spr:jcomop:v:5:y:2001:i:3:d:10.1023_a:1011493126498
    DOI: 10.1023/A:1011493126498
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1011493126498
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1011493126498?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. Balas, Egon & Jeroslow, Robert G., 1980. "Strengthening cuts for mixed integer programs," European Journal of Operational Research, Elsevier, vol. 4(4), pages 224-234, April.
    2. Manfred W. Padberg & M. R. Rao, 1982. "Odd Minimum Cut-Sets and b -Matchings," Mathematics of Operations Research, INFORMS, vol. 7(1), pages 67-80, February.
    3. R. Euler & M. Jünger & G. Reinelt, 1987. "Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra," Mathematics of Operations Research, INFORMS, vol. 12(3), pages 451-462, August.
    4. Matteo Fischetti, 1991. "Facets of the Asymmetric Traveling Salesman Polytope," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 42-56, February.
    5. NEMHAUSER, George L. & WOLSEY, Laurence A., 1990. "A recursive procedure to generate all cuts for 0-1 mixed integer programs," LIDAM Reprints CORE 894, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. M. Deza & M. Grötschel & M. Laurent, 1992. "Clique-Web Facets for Multicut Polytopes," Mathematics of Operations Research, INFORMS, vol. 17(4), pages 981-1000, November.
    7. A. M. H. Gerards, 1985. "Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope," Mathematics of Operations Research, INFORMS, vol. 10(2), pages 359-360, May.
    8. Matteo Fischetti & Paolo Toth, 1997. "A Polyhedral Approach to the Asymmetric Traveling Salesman Problem," Management Science, INFORMS, vol. 43(11), pages 1520-1536, November.
    9. Egon Balas & Sebastián Ceria & Gérard Cornuéjols, 1996. "Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework," Management Science, INFORMS, vol. 42(9), pages 1229-1246, September.
    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. Kerem Akartunalı & Ioannis Fragkos & Andrew J. Miller & Tao Wu, 2016. "Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 766-780, November.
    2. Jamie Fairbrother & Adam N. Letchford & Keith Briggs, 2018. "A two-level graph partitioning problem arising in mobile wireless communications," Computational Optimization and Applications, Springer, vol. 69(3), pages 653-676, April.
    3. Egon Balas, 2005. "Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization," Annals of Operations Research, Springer, vol. 140(1), pages 125-161, November.

    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. Quoc Trung Bui & Yves Deville & Quang Dung Pham, 2016. "Exact methods for solving the elementary shortest and longest path problems," Annals of Operations Research, Springer, vol. 244(2), pages 313-348, September.
    2. Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Other publications TiSEM ed028a07-eb6a-4c8d-8f21-d, Tilburg University, School of Economics and Management.
    3. Michiel A. J. uit het Broek & Albert H. Schrotenboer & Bolor Jargalsaikhan & Kees Jan Roodbergen & Leandro C. Coelho, 2021. "Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm," Operations Research, INFORMS, vol. 69(2), pages 380-409, March.
    4. Egon Balas & Gérard Cornuéjols & Tamás Kis & Giacomo Nannicini, 2013. "Combining Lift-and-Project and Reduce-and-Split," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 475-487, August.
    5. Toth, Paolo, 2000. "Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 125(2), pages 222-238, September.
    6. Sebastián Ceria, 2007. "A brief history of lift-and-project," Annals of Operations Research, Springer, vol. 149(1), pages 57-61, February.
    7. Aardal, K. & van Hoesel, C.P.M., 1995. "Polyhedral techniques in combinatorial optimization," Research Memorandum 014, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    8. Egon Balas, 2005. "Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization," Annals of Operations Research, Springer, vol. 140(1), pages 125-161, November.
    9. Kent Andersen & Gérard Cornuéjols & Yanjun Li, 2005. "Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts," Management Science, INFORMS, vol. 51(11), pages 1720-1732, November.
    10. Matteo Fischetti & Domenico Salvagnin, 2013. "Approximating the Split Closure," INFORMS Journal on Computing, INFORMS, vol. 25(4), pages 808-819, November.
    11. Vilmar Jefté Rodrigues de Sousa & Miguel F. Anjos & Sébastien Le Digabel, 2018. "Computational study of valid inequalities for the maximum k-cut problem," Annals of Operations Research, Springer, vol. 265(1), pages 5-27, June.
    12. Jonathan Eckstein & Mikhail Nediak, 2005. "Depth-Optimized Convexity Cuts," Annals of Operations Research, Springer, vol. 139(1), pages 95-129, October.
    13. Karthekeyan Chandrasekaran & László A. Végh & Santosh S. Vempala, 2016. "The Cutting Plane Method is Polynomial for Perfect Matchings," Mathematics of Operations Research, INFORMS, vol. 41(1), pages 23-48, February.
    14. Amitabh Basu & Robert Hildebrand & Matthias Köppe, 2016. "Light on the infinite group relaxation I: foundations and taxonomy," 4OR, Springer, vol. 14(1), pages 1-40, March.
    15. Mustafa Kılınç & Jeff Linderoth & James Luedtke & Andrew Miller, 2014. "Strong-branching inequalities for convex mixed integer nonlinear programs," Computational Optimization and Applications, Springer, vol. 59(3), pages 639-665, December.
    16. Amitabh Basu & Robert Hildebrand & Matthias Köppe, 2016. "Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms," 4OR, Springer, vol. 14(2), pages 107-131, June.
    17. Subramanyam, Anirudh & Gounaris, Chrysanthos E., 2016. "A branch-and-cut framework for the consistent traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 248(2), pages 384-395.
    18. Santanu S. Dey & Andrea Lodi & Andrea Tramontani & Laurence A. Wolsey, 2014. "On the Practical Strength of Two-Row Tableau Cuts," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 222-237, May.
    19. Hugues Marchand & Laurence A. Wolsey, 2001. "Aggregation and Mixed Integer Rounding to Solve MIPs," Operations Research, INFORMS, vol. 49(3), pages 363-371, June.
    20. Hamidur Rahman & Ashutosh Mahajan, 2020. "On the facet defining inequalities of the mixed-integer bilinear covering set," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(3), pages 545-575, December.

    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:spr:jcomop:v:5:y:2001:i:3:d:10.1023_a:1011493126498. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.