The Fixed-Outdegree 1-Arborescence Polytope

DOI10.1287/MOOR.17.4.1001zbMath0770.90072OpenAlexW2075030161MaRDI QIDQ4027781

Matteo Fischetti, Egon Balas

Publication date: 1 March 1993

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.17.4.1001

zbMATH Keywords

valid inequalitiesasymmetric traveling salesman1-arborescence polytope

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05)

Related Items (8)

A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets ⋮ Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. ⋮ Facets of two Steiner arborescence polyhedra ⋮ Combined route capacity and route length models for unit demand vehicle routing problems ⋮ A complete characterization of jump inequalities for the hop-constrained shortest path problem ⋮ The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints ⋮ A polyhedral study of the asymmetric traveling salesman problem with time windows ⋮ Capacitated ring arborescence problems with profits

This page was built for publication: The Fixed-Outdegree 1-Arborescence Polytope