A classification of formulations for the (time-dependent) traveling salesman problem
From MaRDI portal
Publication:1388929
DOI10.1016/0377-2217(93)E0238-SzbMath0903.90170MaRDI QIDQ1388929
Publication date: 11 June 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Linear programming (90C05) Combinatorial optimization (90C27)
Related Items
An integer programming approach for the time-dependent TSP, An integrated approach for earthwork allocation, sequencing and routing, The traveling salesman problem with time-dependent service times, Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem, A survey for the quadratic assignment problem, Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations, An integer programming approach for the time-dependent traveling salesman problem with time windows, The traveling purchaser problem with time-dependent quantities, The multiple Steiner TSP with order constraints: complexity and optimization algorithms, Scheduling last-mile deliveries with truck-based autonomous robots, Load-dependent and precedence-based models for pickup and delivery problems, Time-dependent routing problems: a review, A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem, On path ranking in time-dependent graphs, A simple and effective metaheuristic for the minimum latency problem, Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem, Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery, Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem, Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND, Enhancing discretized formulations: the knapsack reformulation and the star reformulation, The travelling salesman problem with positional consistency constraints: an application to healthcare services, The time dependent traveling salesman problem: polyhedra and algorithm, Solving the continuous flow-shop scheduling problem by metaheuristics., An alternate formulation of the symmetric traveling salesman problem and its properties, Natural and extended formulations for the time-dependent traveling salesman problem, Reformulation by discretization: application to economic lot sizing, An iterated local search algorithm for the time-dependent vehicle routing problem with time windows, A comparative analysis of several asymmetric traveling salesman problem formulations, Hybrid optimization methods for time-dependent sequencing problems, Exact algorithms for the equitable traveling salesman problem, An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem, Unnamed Item, On the capacitated concentrator location problem: a reformulation by discretization, Facets and valid inequalities for the time-dependent travelling salesman problem, Models and algorithms for the traveling salesman problem with time-dependent service times, An enhanced lower bound for the time-dependent travelling salesman problem, A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem, An optimization model for the vehicle routing problem with practical three-dimensional loading constraints, Solving the traveling delivery person problem with limited computational time, Compact formulations of the Steiner traveling salesman problem and related problems, Looking ahead with the pilot method
Cites Work
- Unnamed Item
- Classification of travelling salesman problem formulations
- An analytical comparison of different formulations of the travelling salesman problem
- The Quadratic Assignment Problem
- State-space relaxation procedures for the computation of bounds to routing problems
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- Time‐dependent traveling salesman problem–the deliveryman case
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- Validation of subgradient optimization
- The traveling salesman problem with cumulative costs
- Solution of a Large-Scale Traveling-Salesman Problem
