( en | de | ru )

 

Disambiguation of "Soriano, Patrick"

Author of the publication

copydeleteadd this publication to your clipboard
Tabu search algorithms for the maximum clique problem.

, and . Cliques, Coloring, and Satisfiability, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 221-242. DIMACS/AMS, (1993)

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.

Federico Soriano

Marcos Soriano Solá

Clemente Soriano-Bazán

José-Manuel Soriano-Romero

Maria-Dolores Soriano López

 

Other publications of authors with the same name

Generating trading rules on the stock markets with genetic programming, , and . Computers & Operations Research, 31 (7): 1033--1047 (2004)A hybrid collaborative algorithm to solve an integrated wood transportation and paper pulp production problem., , and . J. Oper. Res. Soc., 67 (4): 537-550 (2016)Heuristics for multi-period capacity expansion in local telecommunications networks., , , and . J. Heuristics, 15 (4): 381-402 (2009)Solving the maximum clique problem using a tabu search approach., , and . Ann. Oper. Res., 41 (4): 385-403 (1993)Minimization of the Wood Density Variation in Pulp and Paper Production., , and . INFOR Inf. Syst. Oper. Res., 45 (4): 187-196 (2007)Physician Scheduling in Emergency Rooms., , , , , , , and . PATAT, volume 3867 of Lecture Notes in Computer Science, page 53-66. Springer, (2006)An Optimal Strategy for the Constrained Cycle Cover Problem., and . Electron. Notes Discret. Math., (1999)Accelerating Benders Decomposition by Local Branching., , , and . INFORMS J. Comput., 21 (2): 333-345 (2009)A Hybrid Monte Carlo Local Branching Algorithm for the Single Vehicle Routing Problem with Stochastic Demands., , and . Transp. Sci., 44 (1): 136-146 (2010)Tabu search algorithms for the maximum clique problem., and . Cliques, Coloring, and Satisfiability, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 221-242. DIMACS/AMS, (1993)