( en | de | ru )

 

Disambiguation of "Causmaecker, Patrick De"

Author of the publication

copydeleteadd this publication to your clipboard
Evolving test instances of the Hamiltonian completion problem.

, , and . CoRR, (2020)

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.

Amal Dé

Dennis De

Soumen De

Inessa De

Suparna De

 

Other publications of authors with the same name

The Intermittent Traveling Salesman Problem with Different Temperature Profiles: Greedy or not?, , and . CoRR, (2017)Evolving test instances of the Hamiltonian completion problem., , and . CoRR, (2020)Applying Algorithm Selection - a Case Study for the Generalised Assignment Problem., , and . Electron. Notes Discret. Math., (2018)A Combinatorial Benders' decomposition for the lock scheduling problem., , , and . Comput. Oper. Res., (2015)Analysis of Algorithm Components and Parameters: Some Case Studies., and . LION, volume 11353 of Lecture Notes in Computer Science, page 288-303. Springer, (2018)Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems., , , and . Comput. Oper. Res., (2023)Features for the 0-1 knapsack problem based on inclusionwise maximal solutions., , and . Eur. J. Oper. Res., 311 (1): 36-55 (November 2023)A multi criteria meta-heuristic approach to nurse rostering., , , and . IEEE Congress on Evolutionary Computation, page 1197-1202. IEEE, (2002)A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem., , and . SEAL, volume 1585 of Lecture Notes in Computer Science, page 187-194. Springer, (1998)Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem., , , and . CoRR, (2020)