scientific article; zbMATH DE number 3991297

MaRDI QIDQ3753824zbMATH OpenFDO

Authors

Publication date 1987

zbMATH Keywords

branch and boundstrong connectednessasymmetric traveling salesman problemnetwork flow methodsone commodity approach

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 4143778
• Exact solution of large-scale, asymmetric traveling salesman problems
• scientific article; zbMATH DE number 3883908
• scientific article; zbMATH DE number 4029299
• SELECTION OF RELAXATION PROBLEMS FOR A CLASS OF ASYMMETRIC TRAVELING SALESMAN PROBLEM INSTANCES

Cited in

(6)

• scientific article; zbMATH DE number 4029299 (Why is no real title available?)
• scientific article; zbMATH DE number 3883908 (Why is no real title available?)
• The effect of the asymmetry of road transportation networks on the traveling salesman problem
• The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
• scientific article; zbMATH DE number 4143778 (Why is no real title available?)
• SELECTION OF RELAXATION PROBLEMS FOR A CLASS OF ASYMMETRIC TRAVELING SALESMAN PROBLEM INSTANCES

This page was built for publication:

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