On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs

被引：1
|
作者：
Baiou, Mourad [1 ,2 ]
Barahona, Francisco [3 ]
机构：
[1] CNRS, Campus Univ Cezeaux,1 Rue Chebarde,TSA 60125, F-63178 Aubiere, France
[2] Univ Clermont II, Campus Univ Cezeaux,1 Rue Chebarde,TSA 60125, F-63178 Aubiere, France
[3] IBM TJ Watson Res Ctr, Yorktown Hts, NY 10589 USA
来源：
DISCRETE OPTIMIZATION | 2016年 / 22卷
关键词：
p-median problem; Uncapacitated facility location problem; Odd cycle inequalities; PLANT LOCATION PROBLEM; Y-FREE GRAPHS; FACETS;
D O I：
10.1016/j.disopt.2015.07.006
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We study the effect of the odd directed cycle inequalities in the description of the polytope associated with the p-median problem. We treat oriented graphs, i.e., if (u,v) is in the arc-set, then (v, u) is not in the arc-set. We characterize the oriented graphs for which the obvious linear relaxation together with the directed odd cycle inequalities describe the p-median polytope. This study has two parts: in this paper we treat triangle-free graphs, then in a second paper we use induction on the number of triangles to treat general oriented graphs. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码：206 / 224
页数：19
相关论文
共 30 条
  • [21] 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle
    Choi, Ilkyoo
    Ekstein, Jan
    Holub, Premysl
    Lidicky, Bernard
    COMBINATORIAL ALGORITHMS, IWOCA 2014, 2015, 8986 : 98 - 109
  • [22] 3-Coloring Triangle-Free Planar Graphs with a Precolored 8-Cycle
    Dvorak, Zdenek
    Lidicky, Bernard
    JOURNAL OF GRAPH THEORY, 2015, 80 (02) : 98 - 111
  • [23] 3-coloring triangle-free planar graphs with a precolored 9-cycle
    Choi, Ilkyoo
    Ekstein, Jan
    Holub, Premysl
    Lidicky, Bernard
    EUROPEAN JOURNAL OF COMBINATORICS, 2018, 68 : 38 - 65
  • [24] Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time
    Broersma, Hajo
    Golovach, Petr A.
    Paulusma, Daniel
    Song, Jian
    THEORETICAL COMPUTER SCIENCE, 2012, 423 : 1 - 10
  • [25] Revisiting the Hamiltonian p-median problem: A new formulation on directed graphs and a branch-and-cut algorithm
    Bektas, Tolga
    Gouveia, Luis
    Santos, Daniel
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 276 (01) : 40 - 64
  • [26] P6- and triangle-free graphs revisited:: Structure and bounded clique-width
    Brandstaedt, Andreas
    Klembt, Tilo
    Mahfud, Suhail
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2006, 8 (01): : 173 - 188
  • [27] The height of a 4-cycle in triangle-free 1-planar graphs with minimum degree 5
    Borodin O.V.
    Dmitriev I.G.
    Ivanova A.O.
    Journal of Applied and Industrial Mathematics, 2009, 3 (01) : 28 - 31
  • [28] Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete
    Jacobson, MS
    Kezdy, AE
    Lehel, J
    NETWORKS, 1998, 31 (01) : 1 - 10
  • [29] Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time
    Agrawal, Akanksha
    Lima, Paloma T.
    Lokshtanov, Daniel
    Saurabh, Saket
    Sharma, Roohani
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 5276 - 5290
  • [30] Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time
    Agrawal, Akanksha
    Lima, Paloma T.
    Lokshtanov, Daniel
    Saurabh, Saket
    Sharma, Roohani
    Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2024, 2024-January : 5276 - 5290
123