scientific article; zbMATH DE number 1517142

DOI<34::AID-NET4>3.0.CO;2-2 10.1002/1097-0037(200008)36:1<34::AID-NET4>3.0.CO;2-2zbMath0969.90071MaRDI QIDQ4509381

Maarten Oosten, Egon Balas

Publication date: 15 October 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

projectiondirected graphcycle polytopetraveling salesman polytopefacet lifting

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Directed graphs (digraphs), tournaments (05C20)

Related Items (14)

The Steiner cycle polytope ⋮ Solving the asymmetric traveling purchaser problem ⋮ Cycle selections ⋮ Exact Solution Algorithms for the Chordless Cycle Problem ⋮ The traveling purchaser problem and its variants ⋮ A complete characterization of jump inequalities for the hop-constrained shortest path problem ⋮ On cardinality constrained cycle and path polytopes ⋮ Facets of the \((s,t)-p\)-path polytope ⋮ A branch-and-cut algorithm for the median-path 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 ⋮ An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs ⋮ Projection, lifting and extended formulation integer and combinatorial optimization

Cites Work

• On the dimension of projected polyhedra
• The prize collecting traveling salesman problem
• Facets of the Asymmetric Traveling Salesman Polytope
• The Circuit Polytope: Facets
• The prize collecting traveling salesman problem: II. Polyhedral results
• The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph

This page was built for publication: