scientific article; zbMATH DE number 4029299

MaRDI QIDQ3770307zbMATH OpenFDO

Authors G. Laporte, Trinh Kim Nga, Yves Nobert

Publication date 1987

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
• A heuristic circulation-network approach to solve the multi-traveling salesman problem
• scientific article; zbMATH DE number 3991297
• scientific article; zbMATH DE number 37078
• Exact solution of large-scale, asymmetric traveling salesman problems

Cited in

(7)

• The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
• High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system
• An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets
• scientific article; zbMATH DE number 3991297 (Why is no real title available?)
• A heuristic circulation-network approach to solve the multi-traveling salesman problem
• scientific article; zbMATH DE number 37078 (Why is no real title available?)
• scientific article; zbMATH DE number 6178353 (Why is no real title available?)

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 Q3770307)