scientific article; zbMATH DE number 871931
From MaRDI portal
Publication:4875205
zbMath0845.90123MaRDI QIDQ4875205
E. E. Rothberg, L. A. McGeoch, David S. Johnson
Publication date: 16 September 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem, On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem, A new adaptive multi-start technique for combinatorial global optimizations, Best practices for comparing optimization algorithms, Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars, How easy is local search?, Method of scaling in approximate solution of the traveling salesman problem, Variable neighborhood search, Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation, Solving large-scale TSP using a fast wedging insertion partitioning approach, A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem, The TSP phase transition, An approximation of the customer waiting time for online restaurants owning delivery system, The Vehicle Routing Problem with Release and Due Dates, Managing spatio-temporal complexity in Hopfield neural network simulations for large-scale static optimization., Variable neighborhood search for minimum cost berth allocation, Connect the dots: how many random points can a regular curve pass through?, Cut-and-solve: An iterative search strategy for combinatorial optimization problems, On estimating the distribution of optimal traveling salesman tour lengths using heuristics, Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives, A linearithmic heuristic for the travelling salesman problem, POPMUSIC for the travelling salesman problem, A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem, Determination of the candidate arc set for the asymmetric traveling salesman problem, First vs. best improvement: an empirical study, Iterative state-space reduction for flexible computation, Statistical mechanics methods and phase transitions in optimization problems, An improved lower bound for the traveling salesman constant, Estimating the Held-Karp lower bound for the geometric TSP, General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic, Lower bounding techniques for frequency assignment, Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem, New Bounds for the Traveling Salesman Constant, An effective implementation of the Lin-Kernighan traveling salesman heuristic, Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
Uses Software
