The travelling salesman problem on permuted Monge matrices

DOI10.1023/A:1009768317347zbMath0955.90113OpenAlexW1484914719MaRDI QIDQ1288469

Rainer E. Burkard, Gerhard J. Woeginger, Vladimir G. Deǐneko

Publication date: 20 July 1999

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009768317347

zbMATH Keywords

computational complexitycombinatorial optimizationtravelling salesman problemsubtour patching

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (5)

Perspectives of Monge properties in optimization ⋮ Estimation of Monge matrices ⋮ GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY ⋮ Euclidean TSP on two polygons ⋮ Exact and heuristic algorithms for routing AGV on path with precedence constraints

This page was built for publication: The travelling salesman problem on permuted Monge matrices