Pages that link to "Item:Q5510390"
From MaRDI portal
The following pages link to Computer Solutions of the Traveling Salesman Problem (Q5510390):
Displayed 50 items.
- A Lagrangean relaxation heuristic for vehicle routing (Q593987) (← links)
- On the number of iterations of local improvement algorithms (Q594546) (← links)
- The decomposition of a communication network considering traffic demand interrelations (Q679227) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries (Q707138) (← links)
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows (Q707148) (← links)
- Markovian neural networks (Q757249) (← links)
- Transforming asymmetric into symmetric traveling salesman problems (Q787877) (← links)
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem (Q793639) (← links)
- A parallel insert method for the capacitated arc routing problem (Q794931) (← links)
- The multi-depot vehicle routing problem with inter-depot routes (Q852937) (← links)
- The vehicle routing problem with flexible time windows and traveling times (Q860386) (← links)
- On randomization and discovery (Q867607) (← links)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- An efficient implementation of local search algorithms for constrained routing problems (Q918421) (← links)
- The Hamiltonian p-median problem (Q918861) (← links)
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing (Q919753) (← links)
- Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem (Q941025) (← links)
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) (← links)
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem (Q959510) (← links)
- An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms (Q1008897) (← links)
- The optimum assignments and a new heuristic approach for the traveling salesman problem (Q1051562) (← links)
- A note on finding a shortest complete cycle in an undirected graph (Q1069451) (← links)
- An algorithm for the traveling salesman problem with pickup and delivery customers (Q1071656) (← links)
- Experimentation in optimization (Q1084342) (← links)
- Implementation techniques for the vehicle routing problem (Q1086140) (← links)
- Methods for a network design problem in solar power systems (Q1086150) (← links)
- The savings algorithm for the vehicle routing problem (Q1097832) (← links)
- Mapping DNA by stochastic relaxation (Q1099802) (← links)
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
- A comparative study of heuristics for a two-level routing-location problem (Q1143306) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation (Q1158108) (← links)
- A modular algorithm for an extended vehicle scheduling problem (Q1162919) (← links)
- An effective structured approach to finding optimal partitions of networks (Q1164549) (← links)
- Identification of non-optimal arcs for the traveling salesman problem (Q1165781) (← links)
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees (Q1170119) (← links)
- Travelling salesman problem tools for microcomputers (Q1184464) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- Large-step Markov chains for the TSP incorporating local search heuristics (Q1197908) (← links)
- The vehicle routing problem: An overview of exact and approximate algorithms (Q1198313) (← links)
- Quick updates for \(p\)-opt TSP heuristics (Q1198624) (← links)
- On when to stop sampling for the maximum (Q1200523) (← links)
- Operational estimators for the length of a traveling salesman tour (Q1206381) (← links)
- Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient (Q1226033) (← links)
- Optimizing tabu list size for the traveling salesman problem (Q1265842) (← links)
- A Lagrangean heuristic for the maximal covering location problem (Q1266569) (← links)
- The team orienteering problem (Q1266617) (← links)
- A fast and effective heuristic for the orienteering problem (Q1266618) (← links)