A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
From MaRDI portal
Publication:3863432
DOI10.1137/0208045zbMath0427.90064OpenAlexW2062749672MaRDI QIDQ3863432
Publication date: 1979
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/64f83813c07958d0195e4f751fb0cc18da9db297
combinatorial optimizationapproximate solutionprobabilistic analysis of algorithmspatching algorithmnonsymmetric traveling salesman problem
Related Items
Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem, On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem, The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach, An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search, Distributionally robust mixed integer linear programs: persistency models with applications, A survey on combinatorial optimization in dynamic environments, Minimean optimal key arrangements in hash tables, Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem, Ordered spatial sampling by means of the traveling salesman problem, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, On the longest path of a randomly weighted tournament, On the relationship between ATSP and the cycle cover problem, Modeling and solving several classes of arc routing problems as traveling salesman problems, Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem, A note on the complexity of the asymmetric traveling salesman problem, Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems, Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations, Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem, On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph, Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal, Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup, The traveling salesman problem: An overview of exact and approximate algorithms, A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems, The ?(2) limit in the random assignment problem, Random assignment problems, Alternative mathematical models and solution approaches for lot-sizing and scheduling problems in the brewery industry: analyzing two different situations, Construction heuristics for the asymmetric TSP., Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching, A survey of very large-scale neighborhood search techniques, An approximation algorithm for the asymmetric travelling salesman problem with distances one and two, Determination of the candidate arc set for the asymmetric traveling salesman problem, Match twice and stitch: a new TSP tour construction heuristic., A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times, Iterative patching and the asymmetric traveling salesman problem, Quantum optimization, A cutting plane method for risk-constrained traveling salesman problem with random arc costs, Randomized gravitational emulation search algorithm for symmetric traveling salesman problem, Statistical mechanics methods and phase transitions in optimization problems, The Rural Postman Problem on mixed graphs with turn penalties, Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood, Cluster based branching for the asymmetric traveling salesman problem, Average-case approximation ratio of the 2-opt algorithm for the TSP, On patching algorithms for random asymmetric travelling salesman problems, Approximation algorithms for the shortest common superstring problem, On the number ofk-cycles in the assignment problem for random matrices, The asymptotic probabilistic behaviour of quadratic sum assignment problems, The optimum assignments and a new heuristic approach for the traveling salesman problem, A review of TSP based approaches for flowshop scheduling, On random quadratic bottleneck assignment problems, Probabilistic asymptotic properties of some combinatorial optimization problems, Typical values of extremal-weight combinatorial structures with independent symmetric weights, A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
