Some Simple Applications of the Travelling Salesman Problem

DOI10.1057/jors.1975.151zbMath0308.90044OpenAlexW2054630393MaRDI 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

Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20)

Related Items

Modeling supermarket re-layout from the owner's perspective, GADMM: Fast and Communication Efficient Framework for Distributed Machine Learning, Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem, Vehicle routing with full loads, A new mathematical programming formulation for the single-picker routing problem, Learning the travelling salesperson problem requires rethinking generalization, Ordered spatial sampling by means of the traveling salesman problem, Solution of placement and routing problems in telephone exchange unit designs, Introducing complexity curtailing techniques for the tour construction heuristics for the travelling salesperson problem, A speciation-based bilevel niching method for multimodal truss design problems, Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem, Assignment of tools to machines in a flexible manufacturing system, Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem, Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots, An exponential example for Terlaky's pivoting rule for the criss-cross simplex method, Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation, Verschnittoptimierung im praktischen Einsatz. Eine Fallstudie, The stable marriage problem: an interdisciplinary review from the physicist's perspective, Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics, The traveling salesman problem: An overview of exact and approximate algorithms, The vehicle routing problem: An overview of exact and approximate algorithms, Models, relaxations and exact approaches for the capacitated vehicle routing problem, Can the agent with limited information solve travelling salesman problem?, Integer linear programming formulations of multiple salesman problems and its variations, A network flow model for biclustering via optimal re-ordering of data matrices, Constructing blockmodels: how and why, Exact distributional analysis of online algorithms with lookahead, Unnamed Item, Travelling on graphs with small highway dimension, Asymptotic expected performance of some TSP heuristics: An empirical evaluation, Vehicle routing with stochastic demands and restricted failures, A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex, The optimum assignments and a new heuristic approach for the traveling salesman problem, A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem, Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem, Gray codes with restricted density, Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation