The Circuit Polytope: Facets

DOI10.1287/MOOR.22.1.110MaRDI QIDQ4339376zbMATH OpenOpenAlexFDO

Authors P. Bauer

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

zbMATH Keywords

vehicle routingundirected graphcomplete graphfacial structurecutting plane methodscircuit polytopeweighted girth problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Integer programming (90C10) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Transportation, logistics and supply chain management (90B06)

Recommendations

• On cycle cones and polyhedra
• On cycle cones and polyhedra
• scientific article; zbMATH DE number 5021774
• The Steiner cycle polytope
• On the general routing polytope

Cited in

(27)

• A polyhedral approach to an integer multicommodity flow problem
• The Steiner cycle polytope
• On the cycle polytope of a directed graph and its relaxations
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• Exact Solution Algorithms for the Chordless Cycle Problem
• On the linear description of the 3-cycle polytope
• Signed orders, choice probabilities, and linear polytopes
• An exact algorithm for solving the ring star problem
• Modelling and solving central cycle problems with integer programming.
• Circuit and bond polytopes on series-parallel graphs
• Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
• A branch-and-cut algorithm for the capacitated profitable tour problem
• The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
• A stabilized column generation scheme for the traveling salesman subtour problem
• Facet generating techniques
• On the facets and diameter of thek-cycle polytope
• The feasible region for consecutive patterns of permutations is a cycle polytope
• On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
• A branch and cut approach to the cardinality constrained circuit problem.
• A revisited branch-and-cut algorithm for large-scale orienteering problems
• Cycle selections
• Upper and lower bounding procedures for the minimum caterpillar spanning problem
• Locating median cycles in networks
• scientific article; zbMATH DE number 1517142 (Why is no real title available?)
• Facets of the \(p\)-cycle polytope
• On cycle cones and polyhedra
• New techniques for cost sharing in combinatorial optimization games

This page was built for publication: The Circuit Polytope: Facets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339376)