IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v80y2021i4d10.1007_s10898-021-01012-3.html
   My bibliography  Save this article

Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization

Author

Listed:
  • Andriy Shapoval

    (Georgia Institute of Technology
    Georgia Institute of Technology)

  • Eva K. Lee

    (Georgia Institute of Technology)

Abstract

This work starts a new level of research in the area of conflict graphs and hypergraphs. We introduce a new term “mixed conflict hypergraphs”, which comes from merging and generalizing 0-1 conflict hypergraphs and mixed conflict graphs. Two structured mixed integer problems (referred to as convexification of posynomial and signomial functions, CoPF and CoSF, respectively) are solved efficiently with applying new strong cutting planes, outperforming modern commercial software.

Suggested Citation

  • Andriy Shapoval & Eva K. Lee, 2021. "Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization," Journal of Global Optimization, Springer, vol. 80(4), pages 805-840, August.
    • Handle: RePEc:spr:jglopt:v:80:y:2021:i:4:d:10.1007_s10898-021-01012-3
    DOI: 10.1007/s10898-021-01012-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-021-01012-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-021-01012-3?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. 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.
    2. Harlan Crowder & Ellis L. Johnson & Manfred Padberg, 1983. "Solving Large-Scale Zero-One Linear Programming Problems," Operations Research, INFORMS, vol. 31(5), pages 803-834, October.
    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. 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. Wei-Kun Chen & Liang Chen & Mu-Ming Yang & Yu-Hong Dai, 2018. "Generalized coefficient strengthening cuts for mixed integer programming," Journal of Global Optimization, Springer, vol. 70(1), pages 289-306, January.
    3. 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.
    4. Srinivasa, Anand V. & Wilhelm, Wilbert E., 1997. "A procedure for optimizing tactical response in oil spill clean up operations," European Journal of Operational Research, Elsevier, vol. 102(3), pages 554-574, November.
    5. Xiaoyi Gu & Santanu S. Dey & Jean-Philippe P. Richard, 2024. "Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities," INFORMS Journal on Computing, INFORMS, vol. 36(3), pages 884-899, May.
    6. Pourbabai, B. & Ashayeri, J. & Van Wassenhove, L.N., 1992. "Strategic marketing, production, and distribution planning of an integrated manufacturing system," Other publications TiSEM 16c2bacb-2c2b-427e-b429-c, Tilburg University, School of Economics and Management.
    7. B. Dietrich & L. Escudero & A. Garín & G. Pérez, 1993. "O(n) Procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 1(1), pages 139-160, December.
    8. Jose Manuel García, 2024. "New strategy for anti-loop formulations," OPSEARCH, Springer;Operational Research Society of India, vol. 61(4), pages 2346-2359, December.
    9. Amitabh Basu & Pierre Bonami & Gérard Cornuéjols & François Margot, 2011. "Experiments with Two-Row Cuts from Degenerate Tableaux," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 578-590, November.
    10. J. Paul Brooks & Eva K. Lee, 2014. "Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 567-585, August.
    11. Eva K. Lee, 2004. "Generating Cutting Planes for Mixed Integer Programming Problems in a Parallel Computing Environment," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 3-26, February.
    12. Haque, Md Tabish & Hamid, Faiz, 2023. "Social distancing and revenue management—A post-pandemic adaptation for railways," Omega, Elsevier, vol. 114(C).
    13. Olivier Briant & Denis Naddef, 2004. "The Optimal Diversity Management Problem," Operations Research, INFORMS, vol. 52(4), pages 515-526, August.
    14. Escudero Bueno, Laureano F. & Garín Martín, María Araceli & Merino Maestre, María & Pérez Sainz de Rozas, Gloria, 2011. "A parallelizable algorithmic framework for solving large scale multi-stage stochastic mixed 0-1 problems under uncertainty," BILTOKI 1134-8984, Universidad del País Vasco - Departamento de Economía Aplicada III (Econometría y Estadística).
    15. Harjunkoski, Iiro & Westerlund, Tapio & Porn, Ray & Skrifvars, Hans, 1998. "Different transformations for solving non-convex trim-loss problems by MINLP," European Journal of Operational Research, Elsevier, vol. 105(3), pages 594-603, March.
    16. Ambros Gleixner & Leona Gottwald & Alexander Hoen, 2023. "P a PILO: A Parallel Presolving Library for Integer and Linear Optimization with Multiprecision Support," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1329-1341, November.
    17. Manfred Padberg, 2005. "Classical Cuts for Mixed-Integer Programming and Branch-and-Cut," Annals of Operations Research, Springer, vol. 139(1), pages 321-352, October.
    18. Xiangyong Li & Y. P. Aneja, 2012. "A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 443-456, August.
    19. Robert E. Bixby & Eva K. Lee, 1998. "Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut," Operations Research, INFORMS, vol. 46(3), pages 355-367, 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:spr:jglopt:v:80:y:2021:i:4:d:10.1007_s10898-021-01012-3. 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.