scientific article; zbMATH DE number 3956838

MaRDI QIDQ3725893zbMATH OpenFDO

Authors Frank Koerner

Publication date 1985

zbMATH Keywords

approximate solutionsdual assignment problemheuristicsharp boundstraveling salesmantriangle inequality

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35)

Recommendations

• On the refinement of bounds of heuristic algorithms for the traveling salesman problem
• An analytical comparison of different formulations of the travelling salesman problem
• An improved assignment lower bound for the Euclidean traveling salesman problem
• A note on dual solutions of the assignment problem in connection with the traveling salesman problem
• scientific article; zbMATH DE number 5819786

Cited in

(4)

• Transforming asymmetric into symmetric traveling salesman problems: Erratum
• Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem
• An analytical comparison of different formulations of the travelling salesman problem
• On the refinement of bounds of heuristic algorithms for the traveling 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 Q3725893)