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

被引：0
|
作者：
Andriy Shapoval
Eva K. Lee
机构：
[1] Georgia Institute of Technology,H. Milton Stewart School of Industrial and Systems Engineering
[2] Georgia Institute of Technology,Scheller College of Business
来源：
Journal of Global Optimization | 2021年 / 80卷
关键词：
Conflict graphs and hypergraphs; Convexification; Polyhedral analysis;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：805 / 840
页数：35
相关论文
共 50 条
  • [1] Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization
    Shapoval, Andriy
    Lee, Eva K.
    JOURNAL OF GLOBAL OPTIMIZATION, 2021, 80 (04) : 805 - 840
  • [2] Conflict-Free Colourings of Graphs and Hypergraphs
    Pach, Janos
    Tardos, Gabor
    COMBINATORICS PROBABILITY & COMPUTING, 2009, 18 (05): : 819 - 834
  • [3] Conflict Resolution in Arbitrary Hypergraphs
    De Bonis, Annalisa
    ALGORITHMICS OF WIRELESS NETWORKS, ALGOWIN 2023, 2023, 14061 : 13 - 27
  • [4] Conflict avoidance: 0-1 linear models for conflict detection & resolution
    Alonso-Ayuso, A.
    Escudero, L. F.
    Olaso, P.
    Pizarro, C.
    TOP, 2013, 21 (03) : 485 - 504
  • [5] Conflict avoidance: 0-1 linear models for conflict detection & resolution
    A. Alonso-Ayuso
    L. F. Escudero
    P. Olaso
    C. Pizarro
    TOP, 2013, 21 : 485 - 504
  • [6] On variants of conflict-free-coloring for hypergraphs
    Cui, Zhen
    Hu, Ze-Chun
    DISCRETE APPLIED MATHEMATICS, 2017, 220 : 46 - 54
  • [7] Online conflict-free colorings for hypergraphs
    Bar-Noy, Amotz
    Cheilaris, Panagiotis
    Olonetsky, Svetlana
    Smorodinsky, Shakhar
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 219 - +
  • [8] Online Conflict-Free Colouring for Hypergraphs
    Bar-Noyi, A.
    Cheilaris, P.
    Olonetsky, S.
    Smorodinsky, S.
    COMBINATORICS PROBABILITY & COMPUTING, 2010, 19 (04): : 493 - 516
  • [9] UNIQUE-MAXIMUM AND CONFLICT-FREE COLORING FOR HYPERGRAPHS AND TREE GRAPHS
    Cheilaris, Panagiotis
    Keszegh, Balazs
    Palvoelgyi, Doemoetoer
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (04) : 1775 - 1787
  • [10] Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
    Cheilaris, Panagiotis
    Keszegh, Balazs
    Palvoelgyi, Doemoetoer
    SOFSEM 2012: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2012, 7147 : 190 - +
12345