scientific article; zbMATH DE number 871931
From MaRDI portal
Publication:4875205
Recommendations
- Analysis of the Held-Karp lower bound for the asymmetric TSP
- Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem
- Analyzing the Held-Karp TSP bound: A monotonicity property with application
- Optimal bounds for the analytical traveling salesman problem
- On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems
- On the approximability of the traveling salesman problem (extended abstract)
- Experimental analysis of heuristics for the bottleneck traveling salesman problem
- Asymptotic expected performance of some TSP heuristics: An empirical evaluation
- Estimating the Held-Karp lower bound for the geometric TSP
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
Cited in
(36)- New Bounds for the Traveling Salesman Constant
- Euclidean networks with a backbone and a limit theorem for minimum spanning caterpillars
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
- An improved lower bound for the traveling salesman constant
- Variable neighborhood search for minimum cost berth allocation
- Estimating the Held-Karp lower bound for the geometric TSP
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- First vs. best improvement: an empirical study
- An approximation of the customer waiting time for online restaurants owning delivery system
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
- POPMUSIC for the travelling salesman problem
- On estimating the distribution of optimal traveling salesman tour lengths using heuristics
- The TSP phase transition
- Method of scaling in approximate solution of the traveling salesman problem
- Iterative state-space reduction for flexible computation
- Analysis of the Held-Karp lower bound for the asymmetric TSP
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- Managing spatio-temporal complexity in Hopfield neural network simulations for large-scale static optimization.
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
- A linearithmic heuristic for the travelling salesman problem
- Variable neighborhood search
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
- A new adaptive multi-start technique for combinatorial global optimizations
- Lower bounding techniques for frequency assignment
- Statistical mechanics methods and phase transitions in optimization problems
- The Vehicle Routing Problem with Release and Due Dates
- Determination of the candidate arc set for the asymmetric traveling salesman problem
- Solving large-scale TSP using a fast wedging insertion partitioning approach
- How easy is local search?
- Best practices for comparing optimization algorithms
- On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem
- Connect the dots: how many random points can a regular curve pass through?
- Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875205)
