( en | de | ru )

 

Disambiguation of "Pan, Quan-Ke"

Author of the publication

copydeleteadd this publication to your clipboard
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem.

, , and . GECCO, page 158-167. ACM, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Quan Qiu

Quan Liang

Wei Quan

Quan Yuan

Zhongxian Quan

 

Other publications of authors with the same name

Metaheuristic algorithms for the quadratic assignment problem., , , and . CIPLS, page 131-137. IEEE, (2013)Minimizing Total Earliness and Tardiness Penalties with a Common Due Date on a Single-Machine Using a Discrete Particle Swarm Optimization Algorithm., , and . ANTS Workshop, volume 4150 of Lecture Notes in Computer Science, page 460-467. Springer, (2006)An improved harmony search algorithm for multi-dimensional function optimization problem., , and . BIC-TA, page 391-395. IEEE, (2010)Scheduling the blocking flow shop problem using a harmony search algorithm., , , , and . ICNC, page 4258-4262. IEEE, (2010)A differential evolution algorithm with variable neighborhood search for multidimensional knapsack problem., , , and . CEC, page 2797-2804. IEEE, (2015)Solving Fuzzy Job-Shop Scheduling Problem by a Hybrid PSO Algorithm., , , and . ICAISC (SIDE-EC), volume 7269 of Lecture Notes in Computer Science, page 275-282. Springer, (2012)A Variable Iterated Greedy Algorithm with Differential Evolution for Solving No-Idle Flowshops., , , and . ICAISC (SIDE-EC), volume 7269 of Lecture Notes in Computer Science, page 128-135. Springer, (2012)Solving lot-streaming flow shop scheduling problems using a discrete harmony search algorithm., , , and . IEEE Congress on Evolutionary Computation, page 1-6. IEEE, (2010)Upper bounds on Taillard's benchmark suite for the no-wait flowshop scheduling problem with makespan criterion., , , and . IEEE Congress on Evolutionary Computation, page 2955-2961. IEEE, (2008)A novel simplification method of point cloud with directed Hausdorff distance., , , and . CSCWD, page 469-474. IEEE, (2017)