On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs
From MaRDI portal
Publication:1751184
DOI10.1016/j.disopt.2015.07.006zbMath1387.90108OpenAlexW2205589852MaRDI QIDQ1751184
Francisco Barahona, Mourad Baïou
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2015.07.006
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Cites Work
- On the linear relaxation of the \(p\)-median problem
- The \(p\)-median polytope of \(Y\)-free graphs: An application of the matching theory
- The stable set polytope of quasi-line graphs
- On the \(p\)-median polytope of \(Y\)-free graphs
- Geometric algorithms and combinatorial optimization
- Separating lifted odd-hole inequalities to solve the index selection problem
- An algorithm for finding a \(k\)-median in a directed tree
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- On the facets of the simple plant location packing polytope
- Hardness and Algorithms for Variants of Line Graphs of Directed Graphs
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
- Solution methods for thep-median problem: An annotated bibliography
- On the Integrality of Some Facility Location Polytopes
- Fractional vertices, cuts and facets of the simple plant location problem
- The Concavity and Intersection Properties for Integral Polyhedra
- Some facets of the simple plant location polytope
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- On the cut polytope
- On the facial structure of set packing polyhedra
- On the \(p\)-median polytope
- A family of facets for the uncapacitated \(p\)-median polytope
