From post

An Improvement Heuristic Based on Variable Neighborhood Search for Dynamic Orienteering Problems with Changing Node Values and Changing Budgets.

, , и . SN Comput. Sci., 3 (4): 326 (2022)

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.

 

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

Iterated Local Search and Other Algorithms for Buffered Two-Machine Permutation Flow Shops with Constant Processing Times on One Machine., , и . Evol. Comput., 29 (3): 415-439 (2021)Detecting gene breakpoints in noisy genome sequences using position-annotated colored de-Bruijn graphs., , , и . BMC Bioinform., 24 (1): 235 (декабря 2023)Evolutionary Dynamic Multiobjective Optimization via Learning From Historical Search Process., , , и . IEEE Trans. Cybern., 52 (7): 6119-6130 (2022)Bee Nest Site Selection as an Optimization Process., , и . ALIFE, стр. 626-633. MIT Press, (2010)Complete edge-colored permutation graphs., , , , , и . Adv. Appl. Math., (2022)Visual Analysis of Discrete Particle Swarm Optimization Using Fitness Landscapes, , , , и . Recent Advances in the Theory and Application of Fitness Landscapes, том 6 из Emergence, Complexity and Computation, Springer Berlin Heidelberg, (2014)A hierarchical particle swarm optimizer., и . IEEE Congress on Evolutionary Computation, стр. 770-776. IEEE, (2003)An Improvement Heuristic Based on Variable Neighborhood Search for a Dynamic Orienteering Problem., , и . EvoCOP, том 12692 из Lecture Notes in Computer Science, стр. 68-83. Springer, (2021)Sorting Signed Permutations by Inverse Tandem Duplication Random Losses., , и . IEEE ACM Trans. Comput. Biol. Bioinform., 18 (6): 2177-2188 (2021)An Exact Algorithm for Sorting by Weighted Preserving Genome Rearrangements., , и . IEEE ACM Trans. Comput. Biol. Bioinform., 16 (1): 52-62 (2019)