IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/1567.html
   My bibliography  Save this paper

Cutting planes in integer and mixed integer programming

Author

Listed:
  • MARCHAND, Hugues
  • MARTIN, Alexander
  • WEISMANTEL, Robert
  • WOLSEY, Laurence

Abstract

No abstract is available for this item.

Suggested Citation

  • MARCHAND, Hugues & MARTIN, Alexander & WEISMANTEL, Robert & WOLSEY, Laurence, 2002. "Cutting planes in integer and mixed integer programming," LIDAM Reprints CORE 1567, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:1567
    DOI: 10.1016/S0166-218X(01)00348-1
    Note: In : Discrete Applied Mathematics, 123, 397-446, 2002
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Angilella, Vincent & Chardy, Matthieu & Ben-Ameur, Walid, 2018. "Fiber cable network design in tree networks," European Journal of Operational Research, Elsevier, vol. 269(3), pages 1086-1106.
    2. Patrick Manser & Tom Haering & Tim Hillel & Janody Pougala & Rico Krueger & Michel Bierlaire, 2024. "Estimating flexibility preferences to resolve temporal scheduling conflicts in activity-based modelling," Transportation, Springer, vol. 51(2), pages 501-528, April.
    3. Zachary Steever & Chase Murray & Junsong Yuan & Mark Karwan & Marco Lübbecke, 2022. "An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 1849-1870, July.
    4. Ward Romeijnders & Niels van der Laan, 2020. "Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty," Operations Research, INFORMS, vol. 68(4), pages 1199-1217, July.
    5. Santanu S. Dey & Jean-Philippe P. Richard, 2008. "Facets of Two-Dimensional Infinite Group Problems," Mathematics of Operations Research, INFORMS, vol. 33(1), pages 140-166, February.
    6. Kovcs, Andrs & Brown, Kenneth N. & Tarim, S. Armagan, 2009. "An efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups," International Journal of Production Economics, Elsevier, vol. 118(1), pages 282-291, March.
    7. Irvin Lustig & Patricia Randall & Robert Randall, 2021. "Formulation Matters: Reciprocating Integer Programming for Birchbox Product Assortment," Interfaces, INFORMS, vol. 51(5), pages 347-360, September.
    8. 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.
    9. Amar K. Narisetty & Jean-Philippe P. Richard & George L. Nemhauser, 2011. "Lifted Tableaux Inequalities for 0--1 Mixed-Integer Programs: A Computational Study," INFORMS Journal on Computing, INFORMS, vol. 23(3), pages 416-424, August.
    10. Alexander Melnik & Kirill Ermolaev, 2020. "Strategy Context of Decision Making for Improved Energy Efficiency in Industrial Energy Systems," Energies, MDPI, vol. 13(7), pages 1-28, March.
    11. Amir Ahmadi-Javid & Mohammadreza Fathi, 2022. "Design of multi-service systems with facilities functioning as open Jackson queueing networks: application to online shopping stores," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(4), pages 1255-1286, December.
    12. 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.
    13. Mervat Chouman & Teodor Gabriel Crainic & Bernard Gendron, 2017. "Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design," Transportation Science, INFORMS, vol. 51(2), pages 650-667, May.
    14. Amir Ahmadi-Javid & Nasrin Ramshe, 2019. "Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm," 4OR, Springer, vol. 17(4), pages 373-400, December.
    15. Manur, Ashray & Venkataramanan, Giri & Sehloff, David, 2018. "Simple electric utility platform: A hardware/software solution for operating emergent microgrids," Applied Energy, Elsevier, vol. 210(C), pages 748-763.
    16. Santanu S. Dey & Jean-Philippe Richard, 2009. "Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 137-150, February.
    17. Sönke Behrends & Anita Schöbel, 2020. "Generating Valid Linear Inequalities for Nonlinear Programs via Sums of Squares," Journal of Optimization Theory and Applications, Springer, vol. 186(3), pages 911-935, September.
    18. Christopher Hojny & Tristan Gally & Oliver Habeck & Hendrik Lüthen & Frederic Matter & Marc E. Pfetsch & Andreas Schmitt, 2020. "Knapsack polytopes: a survey," Annals of Operations Research, Springer, vol. 292(1), pages 469-517, September.
    19. Santanu S. Dey & Marco Molinaro & Qianyi Wang, 2018. "Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs," Mathematics of Operations Research, INFORMS, vol. 43(1), pages 304-332, February.

    More about this item

    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:cor:louvrp:1567. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.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.