Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
From MaRDI portal
Publication:4745612
DOI10.1287/opre.28.4.1018zbMath0507.90060OpenAlexW2107612355MaRDI QIDQ4745612
Stephen C. Graves, Bezalel Gavish, Kenneth Fox
Publication date: 1980
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.28.4.1018
Related Items
An integer programming approach for the time-dependent TSP, Layered graph approaches for combinatorial optimization problems, Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations, The traveling purchaser problem with time-dependent quantities, A branch-and-price algorithm for the minimum latency problem, Time-dependent routing problems: a review, Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope, On path ranking in time-dependent graphs, A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem, A classification of formulations for the (time-dependent) traveling salesman problem, Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery, A nonlinear optimization model for the balanced vehicle routing problem with loading constraints, The Surgical Patient Routing Problem: A Central Planner Approach, The travelling salesman problem with positional consistency constraints: an application to healthcare services, Mathematical model applied to single-track line scheduling problem in Brazilian railways, The delivery man problem with time windows, The time dependent traveling salesman problem: polyhedra and algorithm, Convergent duality for the traveling salesman problem, An analytical comparison of different formulations of the travelling salesman problem, Natural and extended formulations for the time-dependent traveling salesman problem, Reformulation by discretization: application to economic lot sizing, The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times, A comparative analysis of several asymmetric traveling salesman problem formulations, The multiple-robot assembly plan problem, Exact algorithms for the traveling salesman problem with draft limits, On the capacitated concentrator location problem: a reformulation by discretization, On pedigree polytopes and Hamiltonian cycles, Facets and valid inequalities for the time-dependent travelling salesman problem, Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration, An enhanced lower bound for the time-dependent travelling salesman problem, An optimization model for the vehicle routing problem with practical three-dimensional loading constraints, Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation, Vehicle dispatching with time-dependent travel times
