Roberto Wolfler Calvo
Orcid: 0000-0002-5459-5797
According to our database1,
Roberto Wolfler Calvo
authored at least 71 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Math. Program. Comput., September, 2024
Proceedings of the 10th International Conference on Control, 2024
2023
Discret. Optim., November, 2023
Optimization-driven Demand Prediction Framework for Suburban Dynamic Demand-Responsive Transport Systems.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023
2022
Robustness of solutions to the capacitated facility location problem with uncertain demand.
Optim. Lett., 2022
Discret. Appl. Math., 2022
2021
Optim. Lett., 2021
A Benders squared (B<sup>2</sup>) framework for infinite-horizon stochastic linear programs.
Math. Program. Comput., 2021
INFORMS J. Comput., 2021
A route decomposition approach for the single commodity Split Pickup and Split Delivery Vehicle Routing Problem.
Eur. J. Oper. Res., 2021
Discret. Appl. Math., 2021
Proceedings of the Machine Learning and Knowledge Discovery in Databases. Applied Data Science Track, 2021
2020
Transp. Sci., 2020
Introduction to the Special Section: ROADEF/EURO Challenge 2016 - Inventory Routing Problem.
Transp. Sci., 2020
2019
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints.
Discret. Optim., 2019
2018
A new effective unified model for solving the Pre-marshalling and Block Relocation Problems.
Eur. J. Oper. Res., 2018
Electron. Notes Discret. Math., 2018
Electron. Notes Discret. Math., 2018
2017
2016
A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities.
Electron. Notes Discret. Math., 2016
Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks.
Discret. Optim., 2016
A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016
Dependency Parsing with Bounded Block Degree and Well-nestedness via Lagrangian Relaxation and Branch-and-Bound.
Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics, 2016
2015
An exact algorithm for the static rebalancing problem arising in bicycle sharing systems.
Eur. J. Oper. Res., 2015
2014
ACM J. Exp. Algorithmics, 2014
Eur. J. Oper. Res., 2014
2013
Solving the electricity production planning problem by a column generation based heuristic.
J. Sched., 2013
Oper. Res., 2013
Eur. J. Oper. Res., 2013
Electron. Notes Discret. Math., 2013
Electron. Notes Discret. Math., 2013
2012
The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search.
Eur. J. Oper. Res., 2012
A Label Correcting Algorithm for the Shortest Path Problem on a Multi-modal Route Network.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012
2011
Hybridized evolutionary local search algorithm for the team orienteering problem with time windows.
J. Heuristics, 2011
Comput. Oper. Res., 2011
Proceedings of the Network Optimization - 5th International Conference, 2011
UniALT for regular language contrained shortest paths on a multi-modal transportation network.
Proceedings of the ATMOS 2011, 2011
2010
Proceedings of the Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, 2010
An effective memetic algorithm for the cumulative capacitated vehicle routing problem.
Comput. Oper. Res., 2010
Algorithmic Oper. Res., 2010
4OR, 2010
An Effective Hybrid Evolutionary Local Search for Orienteering and Team Orienteering Problems with Time Windows.
Proceedings of the Parallel Problem Solving from Nature, 2010
2009
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009
An Effective Evolutionary Algorithm for the Cumulative Capacitated Vehicle Routing Problem.
Proceedings of the Applications of Evolutionary Computing, 2009
2008
A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem.
Comput. Oper. Res., 2008
2007
Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic.
Transp. Sci., 2007
2006
Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem.
Ann. Oper. Res., 2006
Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking.
4OR, 2006
A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2006
2005
J. Heuristics, 2005
2004
Comput. Oper. Res., 2004
2003
Comput. Oper. Res., 2003
2002
Eur. J. Oper. Res., 2002
2001
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2001
2000
Transp. Sci., 2000
1997
CVGIP Graph. Model. Image Process., 1997