On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem
From MaRDI portal
Publication:5378843
DOI10.1287/opre.7.1.58zbMath1414.90211WikidataQ96098331 ScholiaQ96098331MaRDI QIDQ5378843
George B. Dantzig, D. R. Fulkerson, Selmer Johnson
Publication date: 3 June 2019
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.7.1.58
Related Items
The traveling salesman problem: An overview of exact and approximate algorithms, A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem, Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies