( en | de | ru )

 

Disambiguation of "Calvo, Roberto Wolfler"

Author of the publication

copydeleteadd this publication to your clipboard
Solving the electricity production planning problem by a column generation based heuristic.

, , , , and . J. Sched., 16 (6): 585-604 (2013)

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.

Roberto Va Calvo

Andreas Wölfler

Paul Wölfler

Felix Calvo-Peralta

Luís M Calvo Salgado

 

Other publications of authors with the same name

A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks., , , and . ISCO, volume 9849 of Lecture Notes in Computer Science, page 260-272. Springer, (2016)Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic., , , , and . Transp. Sci., 41 (4): 470-483 (2007)Optimal Solution of Vehicle Routing Problems with Fractional Objective Function., , , and . Transp. Sci., 54 (2): 434-452 (2020)The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search., , , and . Eur. J. Oper. Res., 220 (1): 15-27 (2012)STEEDS: A strategic transport-energy-environment decision support., , , and . Eur. J. Oper. Res., 139 (2): 416-435 (2002)A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem., , and . Comput. Oper. Res., 35 (5): 1725-1741 (2008)An Exact Method for the Capacitated Location-Routing Problem., , and . Operations Research, 59 (5): 1284-1296 (2011)A heuristic approach to the overnight security service problem., and . Comput. Oper. Res., 30 (9): 1269-1287 (2003)A hybrid heuristic for the multi-activity tour scheduling problem., , , , , and . Electron. Notes Discret. Math., (2018)A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints., , , , and . Discret. Optim., (2019)