Author of the publication

Job sequencing with one common and multiple secondary resources: An A⁎/Beam Search based anytime algorithm.

, , and . Artif. Intell., (2019)

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

Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO., , and . GECCO, page 1187-1194. ACM, (2006)Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges., and . SAC, page 547-552. ACM, (2002)An improved hybrid genetic algorithm for the generalized assignment problem., and . SAC, page 990-995. ACM, (2004)Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms., and . GECCO, page 323-330. ACM, (2008)Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search., , and . Electron. Notes Discret. Math., (2015)An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem., and . Eur. J. Oper. Res., 191 (3): 1004-1022 (2008)A model for finding transition-minors., , and . Discret. Appl. Math., (2020)Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach., , , and . EvoCOP, volume 7832 of Lecture Notes in Computer Science, page 121-132. Springer, (2013)Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles., , and . EvoApplications, volume 8602 of Lecture Notes in Computer Science, page 553-564. Springer, (2014)Effective Neighborhood Structures for the Generalized Traveling Salesman Problem., and . EvoCOP, volume 4972 of Lecture Notes in Computer Science, page 36-47. Springer, (2008)