scientific article; zbMATH DE number 3566552

zbMATH Open0363.90080MaRDI QIDQ4138484FDOQ4138484

Authors:

Publication date: 1977

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cited In (9)

• A restricted Lagrangean approach to the traveling salesman problem
• Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
• The traveling salesman problem: An overview of exact and approximate algorithms
• Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
• Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
• On the stochastic complexity of the asymmetric traveling salesman problem
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
• A note on the complexity of the asymmetric traveling salesman problem
• An additive bounding procedure for the asymmetric travelling salesman problem

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