SELECTION OF RELAXATION PROBLEMS FOR A CLASS OF ASYMMETRIC TRAVELING SALESMAN PROBLEM INSTANCES

DOI10.15807/JORSJ.34.233MaRDI QIDQ4006123zbMATH OpenOpenAlexFDO

Authors Seiji Kataoka, Susumu Morito

Publication date 26 September 1992

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.34.233

zbMATH Keywords

assignment problemasymmetric traveling salesmanLagrange multipliersminimum 1-arborescence relaxation

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Exact solution of large-scale, asymmetric traveling salesman problems
• scientific article; zbMATH DE number 3991297
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
• A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem
• Relaxation of the polytope of the asymmetric travelling salesman problem on the basis of the cone of generalized Supnick's matrices

Cited in

(5)

• Minimum directed 1-subtree relaxation for score orienteering problem
• Determination of the candidate arc set for the asymmetric traveling salesman problem
• Relaxation of the polytope of the asymmetric travelling salesman problem on the basis of the cone of generalized Supnick's matrices
• scientific article; zbMATH DE number 3991297 (Why is no real title available?)
• A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem

This page was built for publication: SELECTION OF RELAXATION PROBLEMS FOR A CLASS OF ASYMMETRIC TRAVELING SALESMAN PROBLEM INSTANCES

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