The Circuit Polytope: Facets
From MaRDI portal
Publication:4339376
DOI10.1287/moor.22.1.110zbMath0871.90099OpenAlexW2106317547MaRDI QIDQ4339376
Publication date: 5 October 1997
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.22.1.110
vehicle routingcomplete graphundirected graphcircuit polytopefacial structurecutting plane methodsweighted girth problem
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items (25)
The Steiner cycle polytope ⋮ Locating median cycles in networks ⋮ New techniques for cost sharing in combinatorial optimization games ⋮ Cycle selections ⋮ A revisited branch-and-cut algorithm for large-scale orienteering problems ⋮ Exact Solution Algorithms for the Chordless Cycle Problem ⋮ A stabilized column generation scheme for the traveling salesman subtour problem ⋮ Facet Generating Techniques ⋮ The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm ⋮ Modelling and solving central cycle problems with integer programming. ⋮ A polyhedral approach to an integer multicommodity flow problem ⋮ Unnamed Item ⋮ An exact algorithm for solving the ring star problem ⋮ On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms ⋮ Circuit and bond polytopes on series-parallel graphs ⋮ Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem ⋮ Facets of the \(p\)-cycle polytope ⋮ On the cycle polytope of a directed graph and its relaxations ⋮ The feasible region for consecutive patterns of permutations is a cycle polytope ⋮ The Ring Star Problem: Polyhedral analysis and exact algorithm ⋮ Upper and lower bounding procedures for the minimum caterpillar spanning problem ⋮ On the facets and diameter of thek-cycle polytope ⋮ A branch-and-cut algorithm for the capacitated profitable tour problem ⋮ Signed orders, choice probabilities, and linear polytopes ⋮ On the linear description of the 3-cycle polytope
This page was built for publication: The Circuit Polytope: Facets
