Author of the publication

A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem.

, , and . Recent Advances in Evolutionary Computation for Combinatorial Optimization, volume 153 of Studies in Computational Intelligence, Springer, (2008)

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

MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics., , and . Matheuristics, volume 10 of Annals of Information Systems, Springer, (2010)A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem., , and . Recent Advances in Evolutionary Computation for Combinatorial Optimization, volume 153 of Studies in Computational Intelligence, Springer, (2008)Solving the Two-Dimensional Bin-Packing Problem with Variable Bin Sizes by Greedy Randomized Adaptive Search Procedures and Variable Neighborhood Search., and . EUROCAST (1), volume 6927 of Lecture Notes in Computer Science, page 456-463. Springer, (2011)Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows., and . Hybrid Metaheuristics, volume 5818 of Lecture Notes in Computer Science, page 45-59. Springer, (2009)Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms., and . GECCO, page 323-330. ACM, (2008)Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem., and . Hybrid Metaheuristics, volume 6373 of Lecture Notes in Computer Science, page 174-189. Springer, (2010)Multilevel Variable Neighborhood Search for Periodic Routing Problems., and . EvoCOP, volume 6022 of Lecture Notes in Computer Science, page 226-238. Springer, (2010)Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem., , and . EvoCOP, volume 4446 of Lecture Notes in Computer Science, page 176-187. Springer, (2007)A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem., , and . EvoCOP, volume 7245 of Lecture Notes in Computer Science, page 13-24. Springer, (2012)Improved Packing and Routing of Vehicles with Compartments., , and . EUROCAST (1), volume 6927 of Lecture Notes in Computer Science, page 392-399. Springer, (2011)