IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v42y1994i1p53-64.html
   My bibliography  Save this article

Fenchel Cutting Planes for Integer Programs

Author

Listed:
  • E. Andrew Boyd

    (Texas A&M University, College Station, Texas)

Abstract

A technique for generating cutting planes for integer programs is introduced that is based on the ability to optimize a linear function on a polyhedron rather than explicit knowledge of the underlying polyhedral structure of the integer program. The theoretical properties of the cuts and their relationship to Lagrangian relaxation are discussed, the cut generation procedure is described, and computational results are presented.

Suggested Citation

  • E. Andrew Boyd, 1994. "Fenchel Cutting Planes for Integer Programs," Operations Research, INFORMS, vol. 42(1), pages 53-64, February.
    • Handle: RePEc:inm:oropre:v:42:y:1994:i:1:p:53-64
    DOI: 10.1287/opre.42.1.53
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.42.1.53
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.42.1.53?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
    ---><---

    Citations

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


    Cited by:

    1. Raphael Kramer & Manuel Iori & Thibaut Vidal, 2020. "Mathematical Models and Search Algorithms for the Capacitated p -Center Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 444-460, April.
    2. Dorneles, Árton P. & de Araújo, Olinto C.B. & Buriol, Luciana S., 2017. "A column generation approach to high school timetabling modeled as a multicommodity flow problem," European Journal of Operational Research, Elsevier, vol. 256(3), pages 685-695.
    3. Agarwal, Y.K. & Aneja, Y.P. & Jayaswal, Sachin, 2022. "Directed fixed charge multicommodity network design: A cutting plane approach using polar duality," European Journal of Operational Research, Elsevier, vol. 299(1), pages 118-136.
    4. Mitchell, John E., 1997. "Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems," European Journal of Operational Research, Elsevier, vol. 97(1), pages 139-148, February.
    5. Christian Va Karsten & Stefan Ropke & David Pisinger, 2018. "Simultaneous Optimization of Container Ship Sailing Speed and Container Routing with Transit Time Restrictions," Transportation Science, INFORMS, vol. 52(4), pages 769-787, August.
    6. 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.
    7. M T Ramos & J Sáez, 2005. "Solving capacitated facility location problems by Fenchel cutting planes," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(3), pages 297-306, March.
    8. Li, Dongjun & Islam, Dewan Md Zahurul & Robinson, Mark & Song, Dong-Ping & Dong, Jing-Xin & Reimann, Marc, 2024. "Network revenue management game in the railway industry: Stackelberg equilibrium, global optimality, and mechanism design," European Journal of Operational Research, Elsevier, vol. 312(1), pages 240-254.
    9. 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.
    10. Yang, Zhen & Chu, Feng & Chen, Haoxun, 2012. "A cut-and-solve based algorithm for the single-source capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 221(3), pages 521-532.
    11. Alves, Maria Joao & Climaco, Joao, 1999. "Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems," European Journal of Operational Research, Elsevier, vol. 117(3), pages 565-577, September.
    12. Liang Chen & Wei-Kun Chen & Mu-Ming Yang & Yu-Hong Dai, 2021. "An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron," Journal of Global Optimization, Springer, vol. 81(3), pages 659-689, November.
    13. Gyana Parija & Radu Gadidov & Wilbert Wilhelm, 1999. "A Facet Generation Procedure for Solving 0/1 Integer Programs," Operations Research, INFORMS, vol. 47(5), pages 789-791, October.
    14. Saravanan Venkatachalam & Lewis Ntaimo, 2023. "Integer set reduction for stochastic mixed-integer programming," Computational Optimization and Applications, Springer, vol. 85(1), pages 181-211, May.

    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:oropre:v:42:y:1994:i:1:p:53-64. 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: 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.