The traveling salesman problem and its variations
From MaRDI portal
Publication:1612766
zbMath0996.00026MaRDI QIDQ1612766
No author found.
Publication date: 4 September 2002
Published in: Combinatorial Optimization (Search for Journal in Brave)
Combinatorial optimization (90C27) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Mathematical programming (90Cxx)
Related Items
Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015, A heuristic framework on a common generalization of the vehicle routing problem and the linear ordering problem, Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem, Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints, Mathematical formulations for a 1-full-truckload pickup-and-delivery problem, Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem, Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics, Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs, Good triangulations yield good tours, The traveling group problem, On the Euclidean TSP with a permuted van der Veen matrix, Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimization, Vehicle routing problems with alternative paths: an application to on-demand transportation, Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems, A polynomial algorithm with asymptotic ratio $2/3$ for the asymmetric maximization version of the $m$-PSP, Dynamic programming in the routing problem: decomposition variant, Hölder curves and parameterizations in the Analyst's traveling salesman theorem, A note on computational aspects of the Steiner traveling salesman problem, Two-stage dynamic programming in the routing problem with decomposition, An LP-based approximation algorithm for the generalized traveling salesman path problem, Unnamed Item, On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics, An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading, Optimizing multi-inserts in routing problems with constraints, Time complexity of the analyst's traveling salesman algorithm, On Eulerian extensions and their application to no-wait flowshop scheduling, The symmetric quadratic traveling salesman problem, The covering Canadian traveller problem, OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS, Unnamed Item, The routing problems with optimization of the starting point: dynamic programming, The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches, A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem, Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem, Solving elementary shortest-path problems as mixed-integer programs, Discrete optimization by optimal control methods. II: The static traveling salesman problem, Cut-and-solve: An iterative search strategy for combinatorial optimization problems, A criterion for the adjacency of vertices of polytopes generated by subsets of symmetric groups, On estimating the distribution of optimal traveling salesman tour lengths using heuristics, An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem, Vehicle routing problems with multiple trips, Online Graph Exploration: New Results on Old and New Algorithms, A Lagrangian-Based Algorithm for a Combinatorial Motion Planning Problem, Vehicle Routing Problems and Container Terminal Operations – An Update of Research, Computing finest mincut partitions of a graph and application to routing problems, Traveling salesman path problems, The linear ordering problem with cumulative costs, The travelling salesman problem with neighbourhoods: MINLP solution, An improved upper bound for the TSP in cubic 3-edge-connected graphs, Expanding neighborhood GRASP for the traveling salesman problem, On pedigree polytopes and Hamiltonian cycles, Solving a Routing Problem with the Aid of an Independent Computations Scheme, Facets and valid inequalities for the time-dependent travelling salesman problem, Generalized Model of Courier with Additional Restrictions, Оptimization of the Start Point in the Gtsp with the Precedence Conditions, The feasible region for consecutive patterns of permutations is a cycle polytope, The Generalized Covering Salesman Problem, The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme, An Approximation Algorithm for the Maximum Traveling Salesman Problem, A Polynomial 3/5-Approximate Algorithm for the Asymmetric Maximization Version of the 3-PSP, The ALGACEA‐1 method for the capacitated vehicle routing problem, Cluster-level operations planning for the out-of-position robotic arc-welding, Randomized heuristics for the family traveling salesperson problem, THE TSP AND THE SUM OF ITS MARGINAL VALUES, New Bounds for the Traveling Salesman Constant, Introduction to reconfiguration, A review of TSP based approaches for flowshop scheduling, A note on single alternating cycle neighborhoods for the TSP, Fast local search algorithms for the handicapped persons transportation problem, Four-point conditions for the TSP: the complete complexity classification, Scheduling multi-colour print jobs with sequence-dependent setup times, An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem, New exponential neighbourhood for polynomially solvable TSPs, Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding, Asymptotically optimal approach for solving some hard discrete optimization problems, A note on the separation of subtour elimination constraints in elementary shortest path problems, Route problem with constraints depending on a list of tasks, On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight, Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph, Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP, The hybrid electric vehicle-traveling salesman problem, A LP-based approximation algorithm for generalized traveling salesperson path problem, The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis, Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices, Metaheuristics for the tabu clustered traveling salesman problem, Scheduling periodic customer visits for a traveling salesperson, Greedy-type resistance of combinatorial problems, A new asymmetric pyramidally solvable class of the traveling salesman problem, Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope, Network construction/restoration problems: cycles and complexity, Solving large-scale TSP using a fast wedging insertion partitioning approach, Multi-depot multiple TSP: a polyhedral study and computational results, A simple LP relaxation for the asymmetric traveling salesman problem, The parameterized complexity of local search for TSP, more refined, The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach, Routing problems with loading constraints, The traveling salesman problem on grids with forbidden neighborhoods, Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem, Online graph exploration: New results on old and new algorithms, A note on the polytope of bipartite TSP, Multitask \(n\)-vehicle exploration problem: complexity and algorithm, Exponential approximation schemata for some network design problems, Maximum travelling salesman problem. I, Computing the variance of tour costs over the solution space of the TSP in polynomial time, An ILP-refined tabu search for the directed profitable rural postman problem, The traveling purchaser problem with stochastic prices: exact and approximate algorithms, A semidefinite optimization approach to the target visitation problem, Transformations of generalized ATSP into ATSP., New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints, The minimum spanning tree problem with conflict constraints and its variations, Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions, Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem, On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space, The symmetric travelling salesman problem. II: New low bounds, Heuristics for routing heterogeneous unmanned vehicles with fuel constraints, Nonlinear resolving functions for the travelling salesman problem, Modeling recreational systems using optimization techniques and information technologies, Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem, A note on the traveling salesman reoptimization problem under vertex insertion, The on-line asymmetric traveling salesman problem, Application of imperialist competitive algorithm on solving the traveling salesman problem, Probabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from above, Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph, Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph, Approximate algorithms for the traveling salesman problem. II, Online covering salesman problem, A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs, Routing under constraints: problem of visit to megalopolises, Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization, An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits, Bee-inspired algorithms applied to vehicle routing problems: a survey and a proposal, A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions, ACS-TS: Train scheduling using ant colony system, The windy rural postman problem with a time-dependent zigzag option, The traveling purchaser problem and its variants, An experimental comparison of seriation methods for one-mode two-way data, Gossip algorithms for heterogeneous multi-vehicle routing problems, Approximation algorithms for multiple terminal, Hamiltonian path problems, 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem, An integer programming-based local search for the covering salesman problem, The effect of the asymmetry of road transportation networks on the traveling salesman problem, A memetic algorithm for the generalized traveling salesman problem, Genetic algorithm for combinatorial path planning: the subtour problem, Computing compatible tours for the symmetric traveling salesman problem, Match twice and stitch: a new TSP tour construction heuristic., The multiagent planning problem, Models for a traveling purchaser problem with additional side-constraints, Lexicographically minimizing axial motions for the Euclidean TSP, \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem, Branch and bound method for multiobjective pairing selection, Approximation algorithms for general cluster routing problem, Traveling salesman problem across well-connected cities and with location-dependent edge lengths, A discrete-continuous routing problem with precedence constraints, Solving the family traveling salesman problem, The indefinite period traveling salesman problem, Global versus local search: the impact of population sizes on evolutionary algorithm performance, New semidefinite programming relaxations for the linear ordering and the traveling salesman problem, Optimizing insertions in a constraint routing problem with complicated cost functions, Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems, Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem, Designing group behavior algorithms for autonomous underwater vehicles in the underwater local heterogeneities survey problem, Approximation algorithms for multi-criteria traveling salesman problems, Heuristic algorithms for a complex parallel machine scheduling problem, An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem, A survey on metaheuristics for stochastic combinatorial optimization, An approximation algorithm for a bottleneck traveling salesman problem, On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks, Traveling salesman games with the Monge property, General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic, Reoptimization of minimum and maximum traveling salesman's tours, A class of exponential neighbourhoods for the quadratic travelling salesman problem, Approximation algorithms with constant ratio for general cluster routing problems, Using the method of conditional expectations to supply an improved starting point for CCLS, Seriation using tree-penalized path length, Unconstrained binary models of the travelling salesman problem variants for quantum optimization, Average-case analysis of best-first search in two representative directed acyclic graphs
Uses Software
