On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem
From MaRDI portal
Publication:5378843
DOI10.1287/opre.7.1.58zbMath1414.90211OpenAlexW2086863198WikidataQ96098331 ScholiaQ96098331MaRDI QIDQ5378843
George B. Dantzig, Selmer Johnson, D. R. Fulkerson
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
Optimization of a 532-city symmetric traveling salesman problem by branch and cut, A polynomial-time solution to Papadimitriou and Steiglitz's ``traps, Discrete dynamical system approaches for Boolean polynomial optimization, Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies, A deterministic better-than-3/2 approximation algorithm for metric TSP, Complexity of branch-and-bound and cutting planes in mixed-integer optimization, The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms, George Dantzig's contributions to integer programming, The traveling salesman problem: An overview of exact and approximate algorithms, A New Formulation for the Travelling Salesman Problem, A penalized method for multivariate concave least squares with application to productivity analysis, Optimizing a linear function over an integer efficient set, An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem, Polyhedral approximations of the semidefinite cone and their application, Nash equilibrium solutions in multi-agent project scheduling with milestones, A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
