Pages that link to "Item:Q5671788"
From MaRDI portal
The following pages link to An Effective Heuristic Algorithm for the Traveling-Salesman Problem (Q5671788):
Displayed 50 items.
- An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem (Q583125) (← links)
- A diagonal completion and 2-optimal procedure for the travelling salesman problem (Q583126) (← links)
- A Lagrangean relaxation heuristic for vehicle routing (Q593987) (← links)
- A modified Lin--Kernighan traveling-salesman heuristic (Q688925) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
- Match twice and stitch: a new TSP tour construction heuristic. (Q703270) (← links)
- A heuristic approach for the travelling purchaser problem (Q707139) (← links)
- Markovian neural networks (Q757249) (← links)
- A study of the application of Kohonen-type neural networks to the travelling salesman problem (Q757268) (← links)
- Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem (Q757282) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Dispatching a fishing trawler fleet in the Canadian Atlantic groundfish industry (Q807381) (← links)
- Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
- Performance analysis of cyclical simulated annealing algorithms (Q812974) (← links)
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability (Q814612) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking (Q862819) (← links)
- On the number of local minima for the multidimensional assignment problem (Q867022) (← links)
- A hybrid scatter search for the probabilistic traveling salesman problem (Q878568) (← links)
- Design and control of warehouse order picking: a literature review (Q881508) (← links)
- Introduction to computation and learning in artificial neural networks (Q914410) (← links)
- An efficient implementation of local search algorithms for constrained routing problems (Q918421) (← links)
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem (Q918425) (← links)
- The Hamiltonian p-median problem (Q918861) (← links)
- Facet identification for the symmetric traveling salesman polytope (Q918865) (← links)
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing (Q919753) (← links)
- On single courier problem (Q941049) (← links)
- Optimal partitioning of a data set based on the \(p\)-median model (Q946677) (← links)
- Golden ratio versus pi as random sequence sources for Monte Carlo integration (Q949528) (← links)
- A filter-and-fan approach to the job shop scheduling problem (Q958547) (← 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)
- GENFOLD 2: A set of models and algorithms for the GENeral unFOLDing analysis of preference/dominance data (Q1057601) (← links)
- Production planning and scheduling for an integrated container company (Q1058968) (← links)
- Randomized algorithms in combinatorial optimization: A survey (Q1077329) (← links)
- Probabilistic exchange algorithms and Euclidean traveling salesman problems (Q1079126) (← links)
- Average and worst-case analysis of heuristics for the maximum tardiness problem (Q1080771) (← links)
- Implementation techniques for the vehicle routing problem (Q1086140) (← links)
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut (Q1089267) (← links)
- Structural analysis of local search heuristics in combinatorial optimization (Q1095797) (← links)
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case (Q1096550) (← links)
- A bi-criteria heuristic for the vehicle routing problem with time windows (Q1102175) (← links)
- How easy is local search? (Q1109573) (← links)
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
- Optimization of the movements of a component placement machine (Q1111924) (← links)
- A new approach to choosing initial points in local search (Q1116345) (← links)
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation (Q1118536) (← links)
- The vehicle routing problem with backhauls (Q1119178) (← links)