The following pages link to (Q4875205):
Displaying 35 items.
- On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
- Variable neighborhood search for minimum cost berth allocation (Q932179) (← links)
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem (Q959510) (← links)
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic (Q1043852) (← links)
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem (Q1044139) (← links)
- How easy is local search? (Q1109573) (← links)
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation (Q1118536) (← links)
- Estimating the Held-Karp lower bound for the geometric TSP (Q1291588) (← links)
- Lower bounding techniques for frequency assignment (Q1292811) (← links)
- A new adaptive multi-start technique for combinatorial global optimizations (Q1342281) (← links)
- Variable neighborhood search (Q1374041) (← links)
- The TSP phase transition (Q1391912) (← links)
- Managing spatio-temporal complexity in Hopfield neural network simulations for large-scale static optimization. (Q1427733) (← links)
- An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821) (← links)
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- Solving large-scale TSP using a fast wedging insertion partitioning approach (Q1666767) (← links)
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem (Q1884968) (← links)
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735) (← links)
- POPMUSIC for the travelling salesman problem (Q1991147) (← links)
- A linearithmic heuristic for the travelling salesman problem (Q2242243) (← links)
- An improved lower bound for the traveling salesman constant (Q2294531) (← links)
- Method of scaling in approximate solution of the traveling salesman problem (Q2392635) (← links)
- An approximation of the customer waiting time for online restaurants owning delivery system (Q2419760) (← links)
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
- On estimating the distribution of optimal traveling salesman tour lengths using heuristics (Q2462111) (← links)
- Determination of the candidate arc set for the asymmetric traveling salesman problem (Q2485161) (← links)
- First vs. best improvement: an empirical study (Q2489903) (← links)
- Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars (Q3465943) (← links)
- The Vehicle Routing Problem with Release and Due Dates (Q5131700) (← links)
- Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives (Q5153496) (← links)
- New Bounds for the Traveling Salesman Constant (Q5246169) (← links)
- Connect the dots: how many random points can a regular curve pass through? (Q5697192) (← links)
- Iterative state-space reduction for flexible computation (Q5940821) (← links)
- Statistical mechanics methods and phase transitions in optimization problems (Q5958800) (← links)
