( en | de | ru )

 

Disambiguation of "Ioannou, George"

Author of the publication

copydeleteadd this publication to your clipboard
A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows.

, , , , and . J. Heuristics, 14 (5): 425-455 (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.

Ekaterini Ioannou

Panagiota Ioannou

Nearchos Ioannou

Georgios Ioannou

George Mertzios

Combinatorial optimization and recognition of graph classes with applications to related models. TU Aachen, (2009)
 

Other publications of authors with the same name

A Reactive Greedy Randomized Variable Neighborhood Tabu Search for the Vehicle Routing Problem with Time Windows., , , and . Hybrid Metaheuristics, volume 4030 of Lecture Notes in Computer Science, page 124-138. Springer, (2006)A Hybrid Metaheuristic for a Real Life Vehicle Routing Problem., , and . Numerical Methods and Applications, volume 4310 of Lecture Notes in Computer Science, page 247-254. Springer, (2006)A web-based decision support system for waste lube oils collection and recycling., , , , and . Eur. J. Oper. Res., 195 (3): 676-700 (2009)Inventory - forecasting: Mind the gap., , , and . Eur. J. Oper. Res., 299 (2): 397-419 (2022)A synthesis of assignment and heuristic solutions for vehicle routing with time windows., and . JORS, 55 (1): 2-11 (2004)Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm., , , and . JORS, 56 (5): 588-596 (2005)Exact, Heuristic and Meta-heuristic Algorithms for Solving Shop Scheduling Problems., , and . Metaheuristics for Scheduling in Industrial and Manufacturing Applications, volume 128 of Studies in Computational Intelligence, Springer, (2008)Two heuristics for the capacitated minimum spanning tree problem with time windows., and . J. Oper. Res. Soc., 70 (4): 555-567 (2019)Valid inequalities for the non-unit demand capacitated minimum spanning tree problem with arc time windows and flow costs., and . Int. J. Prod. Res., 62 (1-2): 574-585 (January 2024)Single versus dynamic lead-time quotations in make-to-order systems with delay-averse customers., , and . Ann. Oper. Res., 318 (1): 33-65 (2022)