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.
- Boltzmann machines for travelling salesman problems (Q1119182) (← links)
- A probabilistic analysis of the switching algorithm for the Euclidean TSP (Q1122505) (← links)
- Multiobjective network scheduling with efficient use of renewable and nonrenewable resources (Q1150305) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- On the expected number of optimal and near-optimal solutions to the Euclidean travelling salesman problem. I (Q1158109) (← links)
- A modular algorithm for an extended vehicle scheduling problem (Q1162919) (← links)
- Verschnittoptimierung im praktischen Einsatz. Eine Fallstudie (Q1168886) (← links)
- Systematic choice of initial points in local search: Extensions and application to neural networks (Q1182102) (← links)
- Iterative rule induction methods (Q1183374) (← links)
- A note on the effect of neighborhood structure in simulated annealing (Q1184445) (← links)
- Travelling salesman problem tools for microcomputers (Q1184464) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- A multiperiod traveling salesman problem: Heuristic algorithms (Q1195106) (← links)
- Large-step Markov chains for the TSP incorporating local search heuristics (Q1197908) (← links)
- New \(({\Delta{}}, D)\) graphs discovered by heuristic search (Q1199407) (← links)
- Paroids: A canonical format for combinatorial optimization (Q1199464) (← links)
- On the solving strategy in composite heuristics (Q1200786) (← links)
- The Euclidean traveling salesman problem is NP-complete (Q1250163) (← links)
- Completely nonmetric multidimensional scaling (Q1256977) (← links)
- New evolutionary genetic algorithms for NP-complete combinatorial optimization problems (Q1262019) (← links)
- Optimizing tabu list size for the traveling salesman problem (Q1265842) (← links)
- Mechanisms for local search (Q1266572) (← links)
- A heuristic algorithm for the asymmetric capacitated vehicle routing problem (Q1266654) (← links)
- Genetic algorithms and traveling salesman problems (Q1268132) (← links)
- Vehicle routing problem with trailers (Q1268206) (← links)
- The use of dynamic programming in genetic algorithms for permutation problems (Q1268271) (← links)
- The life span method -- a new variant of local search (Q1275844) (← links)
- Combination of local search and CLP in the vehicle-fleet scheduling problem (Q1278727) (← links)
- An empirical study of a new metaheuristic for the traveling salesman problem (Q1291637) (← links)
- A model for warehouse order picking (Q1291697) (← links)
- A bicriteria two-machine permutation flowshop problem (Q1296104) (← links)
- Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism (Q1307811) (← links)
- Set-up saving schemes for printed circuit boards assembly (Q1309999) (← links)
- Optimization by hierarchical mutant production (Q1310106) (← links)
- Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation (Q1310113) (← links)
- Genetic local search in combinatorial optimization (Q1317048) (← links)
- A two-dimensional mapping for the traveling salesman problem (Q1324376) (← links)
- Coordination of production and distribution planning (Q1328573) (← links)
- A parallel tabu search algorithm for large traveling salesman problems (Q1329785) (← links)
- A fast optimization method based on a hierarchical strategy for the travelling salesman problem (Q1330340) (← links)
- The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem (Q1331556) (← links)
- Genetically improved presequences for Euclidean traveling salesman problems (Q1341408) (← links)
- A robust strategy approach to a strategic mobility problem (Q1342065) (← links)
- Tabu search performance on the symmetric travelling salesman problem (Q1342103) (← links)
- A TSSP+1 decomposition strategy for the vehicle routing problem (Q1342652) (← links)
- Neural methods for the traveling salesman problem: Insights from operations research (Q1345270) (← links)
- The Convex-hull-and-k-line Travelling Salesman Problem (Q1350909) (← links)
- A linear programming approach to reasoning about probabilities (Q1356219) (← links)
- Scaling features in complex optimization problems (Q1359851) (← links)
- TSP ejection chains (Q1363749) (← links)