The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Computers and Operations Research - Special issue on the traveling salesman problem
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
INFORMS Journal on Computing
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
A very fast Tabu search algorithm for the permutation flow shop problem with makespan criterion
Computers and Operations Research
Genetic algorithms, path relinking, and the flowshop sequencing problem
Evolutionary Computation
Operations Research Letters
Fast parallel cost function calculation for the flow shop scheduling problem
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Solving the flexible job shop problem on GPU
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Hi-index | 0.00 |
We prove that any permutation can be transformed into any other permutation by the execution of at most two swap multimoves (i.e. the diameter of the neighborhood graph is 2). We also prove that it is NP-hard to search over such a neighborhood.