The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
From MaRDI portal
Publication:5203058
DOI10.1137/0402038zbMath0725.05053OpenAlexW2020898729MaRDI QIDQ5203058
Publication date: 1989
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0402038
Related Items
A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets, Clique tree inequalities define facets of the asymmetric traveling salesman polytope, Complete linear descriptions of small asymmetric traveling salesman polytopes, A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs, On cutting-plane proofs in combinatorial optimization, Optimizing over the first Chvátal closure, The interval order polytope of a digraph, Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups., Facets from gadgets, Unnamed Item, New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP, Combined route capacity and route length models for unit demand vehicle routing problems, New facets of the STS polytope generated from known facets of the ATS polytope, Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs, Discrete relaxations of combinatorial programs, A polyhedral study of the asymmetric traveling salesman problem with time windows, A branch-and-cut algorithm for the maximum covering cycle problem, \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts, Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
