( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Experiments with LAGRASP heuristic for set k-covering.

, , и . Optim. Lett., 5 (3): 407-419 (2011)

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.

André G. C. Pacheco

Christian G C Marxt

C A G Charpentier

Constantin G lu c

Stephan G C Kloess

 

Другие публикации лиц с тем же именем

Random-Key Genetic Algorithms., и . Handbook of Heuristics, Springer, (2018)Continuous GRASP with a local active-set method for bound-constrained global optimization., , , и . J. Glob. Optim., 48 (2): 289-310 (2010)The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications., , , и . Eur. J. Oper. Res., 289 (1): 17-30 (2021)Algorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using GRASP., , и . ACM Trans. Math. Softw., 24 (4): 386-394 (1998)TTT plots: a perl program to create time-to-target plots., , и . Optim. Lett., 1 (4): 355-366 (2007)Experiments with LAGRASP heuristic for set k-covering., , и . Optim. Lett., 5 (3): 407-419 (2011)A biased random-key genetic algorithm for single-round divisible load scheduling., , , и . Int. Trans. Oper. Res., 22 (5): 823-839 (2015)An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem., , , , , и . SEA, том 6630 из Lecture Notes in Computer Science, стр. 421-433. Springer, (2011)A BRKGA with Implicit Path-Relinking for the Vehicle Routing Problem with Occasional Drivers and Time Windows., , , и . MIC, том 13838 из Lecture Notes in Computer Science, стр. 17-29. Springer, (2022)On the fast solution of the p-center problem., , , и . ICTON, стр. 1-4. IEEE, (2017)