Author of the publication

A Parallel Large Neighborhood Search-Based Heuristic for the Disjunctively Constrained Knapsack Problem.

, , , , and . IPDPS Workshops, page 1547-1551. IEEE Computer Society, (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 swarm optimization-based search algorithm for the quadratic knapsack problem with conflict Graphs., , , and . Expert Syst. Appl., (2020)A Cooperative Swarm Optimization-Based Algorithm for the Quadratic Multiple Knapsack Problem., , , and . CoDIT, page 1168-1173. IEEE, (2020)High Performance Peer-to-Peer Distributed Computing with Application to Constrained Two-Dimensional Guillotine Cutting Problem., , and . PDP, page 552-559. IEEE Computer Society, (2011)A Two-Stage Resolution Search-Based Heuristic for the Team Orienteering Problem., , and . FiCloud, page 442-447. IEEE Computer Society, (2014)A parallel algorithm for constrained two-staged two-dimensional cutting problems., , , and . Comput. Ind. Eng., 62 (1): 177-189 (2012)A Parallel Large Neighborhood Search-Based Heuristic for the Disjunctively Constrained Knapsack Problem., , , , and . IPDPS Workshops, page 1547-1551. IEEE Computer Society, (2014)Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem., , and . INFORMS J. Comput., 20 (2): 212-221 (2008)A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems., and . Comput. Optim. Appl., 51 (2): 783-807 (2012)Neighborhood search-based heuristic for the k-clustering minimum biclique completion problem., , and . CoDIT, page 639-643. IEEE, (2016)Peer-to-Peer Solution of 2D Cutting Stocks Problems., , and . CTW, page 116-120. (2012)