IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v30y2018i3p570-587.html
   My bibliography  Save this article

Structure Detection in Mixed-Integer Programs

Author

Listed:
  • Taghi Khaniyev

    (Department of Management Sciences, University of Waterloo, Waterloo, Ontario N2H 3G1, Canada)

  • Samir Elhedhli

    (Department of Management Sciences, University of Waterloo, Waterloo, Ontario N2H 3G1, Canada)

  • Fatih Safa Erenay

    (Department of Management Sciences, University of Waterloo, Waterloo, Ontario N2H 3G1, Canada)

Abstract

Despite vast improvements in computational power, many large-scale optimization problems involving integer variables remain difficult to solve. Certain classes, however, can be efficiently solved by exploiting special structure. One such structure is the singly bordered block-diagonal (BBD) structure that lends itself to Dantzig-Wolfe decomposition, Lagrangian relaxation, and branch and price. We start by introducing a new measure of goodness to capture desired features in BBD structures such as granularity of the structure, homogeneity of the block sizes, and isomorphism of the blocks. We then use it to propose a new approach to identify the best BBD structure inherent in the constraint matrix. The main building block of the proposed approach is the use of a community detection methodology in lieu of graph/hypergraph partitioning methods to alleviate one major drawback of the existing approaches in the literature: predefining the number of blocks. When tested on MIPLIB2003/2010 instances and compared against the state-of-the-art technique, the proposed algorithm is found to identify very good structures and require shorter CPU time to reach comparable bounds, in most cases.

Suggested Citation

  • Taghi Khaniyev & Samir Elhedhli & Fatih Safa Erenay, 2018. "Structure Detection in Mixed-Integer Programs," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 570-587, August.
  • Handle: RePEc:inm:orijoc:v:30:y:2018:i:3:p:570-587
    DOI: 10.1287/ijoc.2017.0797
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/ijoc.2017.0797
    Download Restriction: no

    File URL: https://libkey.io/10.1287/ijoc.2017.0797?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
    ---><---

    References listed on IDEAS

    as
    1. Roman L. Weil & Paul C. Kettler, 1971. "Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms," Management Science, INFORMS, vol. 18(1), pages 98-108, September.
    2. VANDERBECK, François & WOLSEY, Laurence A., 2010. "Reformulation and decomposition of integer programs," LIDAM Reprints CORE 2188, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Zheng, Yuchen & Xie, Yujia & Lee, Ilbin & Dehghanian, Amin & Serban, Nicoleta, 2022. "Parallel subgradient algorithm with block dual decomposition for large-scale optimization," European Journal of Operational Research, Elsevier, vol. 299(1), pages 60-74.

    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. Codas, Andrés & Camponogara, Eduardo, 2012. "Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing," European Journal of Operational Research, Elsevier, vol. 217(1), pages 222-231.
    2. Christensen, Tue R.L. & Labbé, Martine, 2015. "A branch-cut-and-price algorithm for the piecewise linear transportation problem," European Journal of Operational Research, Elsevier, vol. 245(3), pages 645-655.
    3. Maxence Delorme & Manuel Iori, 2020. "Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 101-119, January.
    4. René Brandenberg & Paul Stursberg, 2021. "Refined cut selection for benders decomposition: applied to network capacity expansion problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(3), pages 383-412, December.
    5. 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.
    6. Alberto Caprara & Fabio Furini & Enrico Malaguti, 2013. "Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 560-571, August.
    7. Artur Pessoa & Ruslan Sadykov & Eduardo Uchoa, 2021. "Solving Bin Packing Problems Using VRPSolver Models," SN Operations Research Forum, Springer, vol. 2(2), pages 1-25, June.
    8. Pedro Munari & Alfredo Moreno & Jonathan De La Vega & Douglas Alem & Jacek Gondzio & Reinaldo Morabito, 2019. "The Robust Vehicle Routing Problem with Time Windows: Compact Formulation and Branch-Price-and-Cut Method," Transportation Science, INFORMS, vol. 53(4), pages 1043-1066, July.
    9. Wasakorn Laesanklang & Dario Landa-Silva, 2017. "Decomposition techniques with mixed integer programming and heuristics for home healthcare planning," Annals of Operations Research, Springer, vol. 256(1), pages 93-127, September.
    10. Park, Jongyoon & Han, Jinil & Lee, Kyungsik, 2022. "Integer Optimization Model and Algorithm for the Stem Cell Culturing Problem," Omega, Elsevier, vol. 108(C).
    11. Seyed Ahmad Hosseini, 2013. "A Model-Based Approach and Analysis for Multi-Period Networks," Journal of Optimization Theory and Applications, Springer, vol. 157(2), pages 486-512, May.
    12. Park, Jongyoon & Han, Jinil & Lee, Kyungsik, 2024. "Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem," European Journal of Operational Research, Elsevier, vol. 317(1), pages 43-59.
    13. Rigo, Cezar Antônio & Seman, Laio Oriel & Camponogara, Eduardo & Morsch Filho, Edemar & Bezerra, Eduardo Augusto & Munari, Pedro, 2022. "A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service," European Journal of Operational Research, Elsevier, vol. 303(1), pages 168-183.
    14. Lluís-Miquel Munguía & Geoffrey Oxberry & Deepak Rajan & Yuji Shinano, 2019. "Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs," Computational Optimization and Applications, Springer, vol. 73(2), pages 575-601, June.
    15. Bruno P. Bruck & Fábio Cruz & Manuel Iori & Anand Subramanian, 2019. "The Static Bike Sharing Rebalancing Problem with Forbidden Temporary Operations," Transportation Science, INFORMS, vol. 53(3), pages 882-896, May.
    16. van Lieshout, R.N. & Bouman, P.C. & Huisman, D., 2018. "Determining and Evaluating Alternative Line Plans in (Near) Out-of-Control Situations," Econometric Institute Research Papers EI2018-20, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    17. S. Basso & A. Ceselli & A. Tettamanzi, 2020. "Random sampling and machine learning to understand good decompositions," Annals of Operations Research, Springer, vol. 284(2), pages 501-526, January.
    18. Thomas, Anu & Venkateswaran, Jayendran & Singh, Gaurav & Krishnamoorthy, Mohan, 2014. "A resource constrained scheduling problem with multiple independent producers and a single linking constraint: A coal supply chain example," European Journal of Operational Research, Elsevier, vol. 236(3), pages 946-956.
    19. Ambros Gleixner & Stephen J. Maher & Benjamin Müller & João Pedro Pedroso, 2020. "Price-and-verify: a new algorithm for recursive circle packing using Dantzig–Wolfe decomposition," Annals of Operations Research, Springer, vol. 284(2), pages 527-555, January.
    20. Gondzio, Jacek & González-Brevis, Pablo & Munari, Pedro, 2013. "New developments in the primal–dual column generation technique," European Journal of Operational Research, Elsevier, vol. 224(1), pages 41-51.

    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:inm:orijoc:v:30:y:2018:i:3:p:570-587. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.