scientific article; zbMATH DE number 2064412
From MaRDI portal
Publication:4461911
zbMath1113.90356MaRDI QIDQ4461911
L. A. McGeoch, David S. Johnson
Publication date: 18 May 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem, An optimization approach for communal home meal delivery service: A case study, Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic, Data structures and ejection chains for solving large-scale traveling salesman problems, MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem, GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem, Multicriteria tour planning for mobile healthcare facilities in a developing country, Introducing complexity curtailing techniques for the tour construction heuristics for the travelling salesperson problem, Solving large-scale TSP using a fast wedging insertion partitioning approach, A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem, An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem, The parameterized complexity of local search for TSP, more refined, Discrete heat transfer search for solving travelling salesman problem, A comparison of three metaheuristics for the workover rig routing problem, Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem, Traveling salesman problem heuristics: leading methods, implementations and latest advances, On the generation of metric TSP instances with a large integrality gap by branch-and-cut, Smoothed analysis of partitioning algorithms for Euclidean functionals, Instance-specific multi-objective parameter tuning based on fuzzy logic, Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem, Searching the \(k\)-change neighborhood for TSP is W[1-hard], Subsets of rectifiable curves in Hilbert space-the analyst's TSP, On estimating the distribution of optimal traveling salesman tour lengths using heuristics, Random shortest paths: non-Euclidean instances for metric optimization problems, A discrete gravitational search algorithm for solving combinatorial optimization problems, Experimental analysis of heuristics for the bottleneck traveling salesman problem, Multi-objective vehicle routing problems, The Gestalt heuristic: emerging abstraction to improve combinatorial search, A memetic algorithm for the generalized traveling salesman problem, Computing compatible tours for the symmetric traveling salesman problem, Extended neighborhood: Definition and characterization, Match twice and stitch: a new TSP tour construction heuristic., Expanding neighborhood GRASP for the traveling salesman problem, An efficient heuristic algorithm for the bottleneck traveling salesman problem, Locating a cycle in a transportation or a telecommunications network, Iterated local search for the quadratic assignment problem, Hybrid metaheuristics for the vehicle routing problem with stochastic demands, A Sensitive Metaheuristic for Solving a Large Optimization Problem, Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP, Design and analysis of stochastic local search for the multiobjective traveling salesman problem, Continuous reformulations and heuristics for the Euclidean travelling salesperson problem, A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem, Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio, General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic, A review of TSP based approaches for flowshop scheduling, A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices, A note on single alternating cycle neighborhoods for the TSP, IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem, Unnamed Item, A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem, An efficient evolutionary algorithm for the ring star problem
Uses Software
