Some Simple Applications of the Travelling Salesman Problem

DOI10.1057/jors.1975.151zbMath0308.90044MaRDI QIDQ4066863

Alexander H. G. Rinnooy Kan, Jan Karel Lenstra

Publication date: 1975

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/21760

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C10: Integer programming

90B35: Deterministic scheduling theory in operations research

90B20: Traffic problems in operations research

Related Items

Models, relaxations and exact approaches for the capacitated vehicle routing problem, An exponential example for Terlaky's pivoting rule for the criss-cross simplex method, The optimum assignments and a new heuristic approach for the traveling salesman problem, Gray codes with restricted density, Vehicle routing with full loads, Solution of placement and routing problems in telephone exchange unit designs, Assignment of tools to machines in a flexible manufacturing system, Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation, Verschnittoptimierung im praktischen Einsatz. Eine Fallstudie, The traveling salesman problem: An overview of exact and approximate algorithms, The vehicle routing problem: An overview of exact and approximate algorithms, Constructing blockmodels: how and why, A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex, Asymptotic expected performance of some TSP heuristics: An empirical evaluation, Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots, Integer linear programming formulations of multiple salesman problems and its variations, Vehicle routing with stochastic demands and restricted failures