Author of the publication

Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem.

, and . CP, volume 8656 of Lecture Notes in Computer Science, page 549-563. Springer, (2014)

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.

 

Other publications of authors with the same name

A case study of mutual routing-scheduling reformulation., , and . J. Sched., 9 (5): 469-491 (2006)Scaling Effects in the CSP Phase Transition., , , and . CP, volume 976 of Lecture Notes in Computer Science, page 70-87. Springer, (1995)Understanding the Empirical Hardness of Random Optimisation Problems., , and . CP, volume 11802 of Lecture Notes in Computer Science, page 333-349. Springer, (2019)Greedy Graph Colouring is a Misleading Heuristic., and . CoRR, (2013)An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists., and . ECAI, page 141-145. IOS Press, (2002)Vehicle Routing and Job Shop Scheduling: What's the Difference?, , and . ICAPS, page 267-276. AAAI, (2003)A distributed asynchronous system for predictive and reactive scheduling., and . Artif. Intell. Eng., 6 (3): 106-124 (1991)Heuristics and Really Hard Instances for Subgraph Isomorphism Problems., , and . IJCAI, page 631-638. IJCAI/AAAI Press, (2016)Variable Ordering Heuristics Show Promise., , and . CP, volume 3258 of Lecture Notes in Computer Science, page 711-715. Springer, (2004)The Dynamics of Dynamic Variable Ordering Heuristics.. CP, volume 1520 of Lecture Notes in Computer Science, page 17-23. Springer, (1998)