Use of Neural Networks to Estimate the Number of Nodes of an Edge Quadtree. - Fabio Alberto Schreiber; R. Calvo Wolfler (CVGIP Graph. Model. Image Process., 1997)

A New Heuristic for the Traveling Salesman Problem with Time Windows. - Roberto Wolfler Calvo (Transp. Sci., 2000)

A Heuristic for the Vehicle Routing Problem with Time Windows. - Roberto Cordone; Roberto Wolfler Calvo (J. Heuristics, 2001)

An efficient heuristic approach to solve the unate covering problem. - Roberto Cordone; Fabrizio Ferrandi; Donatella Sciuto; Roberto Wolfler Calvo (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2001)

STEEDS: A strategic transport-energy-environment decision support. - Christian Brand; M. Mattarelli; D. Moon; Roberto Wolfler Calvo (Eur. J. Oper. Res., 2002)

A heuristic approach to the overnight security service problem. - Roberto Wolfler Calvo; Roberto Cordone (Comput. Oper. Res., 2003)

A distributed geographic information system for the daily car pooling problem. - Roberto Wolfler Calvo; Fabio de Luigi; Palle Haastrup; Vittorio Maniezzo (Comput. Oper. Res., 2004)

A Metaheuristic to Solve a Location-Routing Problem with Non-Linear Costs. - Jan Melechovský; Christian Prins; Roberto Wolfler Calvo (J. Heuristics, 2005)

A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem. - Christian Prins; Caroline Prodhon; Roberto Wolfler Calvo (EvoCOP, 2006)

Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. - Christian Prins; Caroline Prodhon; Roberto Wolfler Calvo (4OR, 2006)

Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem. - Christian Prins; Caroline Prodhon; Roberto Wolfler Calvo (Ann. Oper. Res., 2006)

An effective and fast heuristic for the Dial-a-Ride problem. - Roberto Wolfler Calvo; Alberto Colorni (4OR, 2007)

Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic. - Christian Prins; Caroline Prodhon; Angel B. Ruiz; Patrick Soriano; Roberto Wolfler Calvo (Transp. Sci., 2007)

A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. - Abdellah El-Fallahi; Christian Prins; Roberto Wolfler Calvo (Comput. Oper. Res., 2008)

An Effective Evolutionary Algorithm for the Cumulative Capacitated Vehicle Routing Problem. - Sandra Ulrich Ngueveu; Christian Prins; Roberto Wolfler Calvo (EvoWorkshops, 2009)

On the Complexity of the Multiple Stack TSP, kSTSP. - Sophie Toulouse; Roberto Wolfler Calvo (TAMC, 2009)

An Effective Hybrid Evolutionary Local Search for Orienteering and Team Orienteering Problems with Time Windows. - Nacima Labadi; Jan Melechovský; Roberto Wolfler Calvo (PPSN (2), 2010)

Lower and upper bounds for the m-peripatetic vehicle routing problem. - Sandra Ulrich Ngueveu; Christian Prins; Roberto Wolfler Calvo (4OR, 2010)

Approximating the metric 2-Peripatetic Salesman Problem. - Federico Della Croce; Vangelis Th. Paschos; Roberto Wolfler Calvo (Algorithmic Oper. Res., 2010)

An effective memetic algorithm for the cumulative capacitated vehicle routing problem. - Sandra Ulrich Ngueveu; Christian Prins; Roberto Wolfler Calvo (Comput. Oper. Res., 2010)

Metaheuristics for logistics and vehicle routing. - Christian Prins; Nacima Labadi; Caroline Prodhon; Roberto Wolfler Calvo (Comput. Oper. Res., 2010)

A Hybrid Tabu Search for the m-Peripatetic Vehicle Routing Problem. - Sandra Ulrich Ngueveu; Christian Prins; Roberto Wolfler Calvo (Matheuristics, 2010)

UniALT for regular language contrained shortest paths on a multi-modal transportation network. - Dominik Kirchler; Leo Liberti; Thomas Pajor; Roberto Wolfler Calvo (ATMOS, 2011)

A Matheuristic for the Dial-a-Ride Problem. - Roberto Wolfler Calvo; Nora Touati Moungla (INOC, 2011)

A Branch-and-Cut method for the Capacitated Location-Routing Problem. - José-Manuel Belenguer; Enrique Benavent; Christian Prins; Caroline Prodhon; Roberto Wolfler Calvo (Comput. Oper. Res., 2011)

Hybridized evolutionary local search algorithm for the team orienteering problem with time windows. - Nacima Labadi; Jan Melechovský; Roberto Wolfler Calvo (J. Heuristics, 2011)

An Exact Method for the Capacitated Location-Routing Problem. - Roberto Baldacci; Aristide Mingozzi; Roberto Wolfler Calvo (Oper. Res., 2011)

A Label Correcting Algorithm for the Shortest Path Problem on a Multi-modal Route Network. - Dominik Kirchler; Leo Liberti; Roberto Wolfler Calvo (SEA, 2012)

The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search. - Nacima Labadi; Renata Mansini; Jan Melechovský; Roberto Wolfler Calvo (Eur. J. Oper. Res., 2012)

Bike sharing systems: Solving the static rebalancing problem. - Daniel Chemla; Frédéric Meunier; Roberto Wolfler Calvo (Discret. Optim., 2013)

A matheuristic approach for solving a home health care problem. - Hanane Allaoua; Sylvie Borne; Lucas Létocart; Roberto Wolfler Calvo (Electron. Notes Discret. Math., 2013)

Efficient algorithms for the 2-Way Multi Modal Shortest Path Problem. - Marie-José Huguet; Dominik Kirchler; Pierre Parent; Roberto Wolfler Calvo (Electron. Notes Discret. Math., 2013)

An analytical approach to calculate the capacity of a railway system. - Lorenzo Mussone; Roberto Wolfler Calvo (Eur. J. Oper. Res., 2013)

An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem. - Roberto Baldacci; Aristide Mingozzi; Roberto Roberti; Roberto Wolfler Calvo (Oper. Res., 2013)

Solving the electricity production planning problem by a column generation based heuristic. - Antoine Rozenknop; Roberto Wolfler Calvo; Laurent Alfandari; Daniel Chemla; Lucas Létocart (J. Sched., 2013)

New Lower Bounds and Exact Method for the m-PVRP. - Sandra Ulrich Ngueveu; Christian Prins; Roberto Wolfler Calvo (Transp. Sci., 2013)

The static bicycle relocation problem with demand intervals. - Günes Erdogan; Gilbert Laporte; Roberto Wolfler Calvo (Eur. J. Oper. Res., 2014)

Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks. - Dominik Kirchler; Leo Liberti; Roberto Wolfler Calvo (ACM J. Exp. Algorithmics, 2014)

Shared mobility systems. - Gilbert Laporte; Frédéric Meunier; Roberto Wolfler Calvo (4OR, 2015)

An exact algorithm for the static rebalancing problem arising in bicycle sharing systems. - Günes Erdogan; Maria Battarra; Roberto Wolfler Calvo (Eur. J. Oper. Res., 2015)

Dependency Parsing with Bounded Block Degree and Well-nestedness via Lagrangian Relaxation and Branch-and-Bound. - Caio Corro; Joseph Le Roux; Mathieu Lacroix 001; Antoine Rozenknop; Roberto Wolfler Calvo (ACL (1), 2016)

A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks. - Michele Barbato; Roland Grappe; Mathieu Lacroix 001; Roberto Wolfler Calvo (ISCO, 2016)

Fast machine reassignment. - Franck Butelle; Laurent Alfandari; Camille Coti; Lucian Finta; Lucas Létocart; Gérard Plateau; Frédéric Roupin; Antoine Rozenknop; Roberto Wolfler Calvo (Ann. Oper. Res., 2016)

Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks. - Michele Barbato; Roland Grappe; Mathieu Lacroix 001; Roberto Wolfler Calvo (Discret. Optim., 2016)

A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities. - Paolo Gianessi; Alberto Ceselli; Lucas Létocart; Roberto Wolfler Calvo (Electron. Notes Discret. Math., 2016)

The Multicommodity-Ring Location Routing Problem. - Paolo Gianessi; Laurent Alfandari; Lucas Létocart; Roberto Wolfler Calvo (Transp. Sci., 2016)

The Vehicle Routing Problem with Transhipment Facilities. - Roberto Baldacci; Sandra Ulrich Ngueveu; Roberto Wolfler Calvo (Transp. Sci., 2017)

Shared mobility systems: an updated survey. - Gilbert Laporte; Frédéric Meunier; Roberto Wolfler Calvo (Ann. Oper. Res., 2018)

A branch and price approach for the Split Pickup and Split Delivery VRP. - Marco Casazza; Alberto Ceselli; Roberto Wolfler Calvo (Electron. Notes Discret. Math., 2018)

A hybrid heuristic for the multi-activity tour scheduling problem. - Stefania Pan; Mahuna Akplogan; Nora Touati Moungla; Lucas Létocart; Roberto Wolfler Calvo; Louis-Martin Rousseau (Electron. Notes Discret. Math., 2018)

A new effective unified model for solving the Pre-marshalling and Block Relocation Problems. - Marcos de Melo da Silva; Sophie Toulouse; Roberto Wolfler Calvo (Eur. J. Oper. Res., 2018)

Preface: Emerging challenges in transportation planning. - Roberto Wolfler Calvo; Lucas Létocart; Roberto Baldacci (Networks, 2018)

The multiple vehicle balancing problem. - Marco Casazza; Alberto Ceselli; Daniel Chemla; Frédéric Meunier; Roberto Wolfler Calvo (Networks, 2018)

A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints. - Stefania Pan; Roberto Wolfler Calvo; Mahuna Akplogan; Lucas Létocart; Nora Touati Moungla (Discret. Optim., 2019)

An exact algorithm for robust influence maximization. - Giacomo Nannicini; Giorgio Sartor; Emiliano Traversi; Roberto Wolfler Calvo (Math. Program., 2020)

Introduction to the Special Section: ROADEF/EURO Challenge 2016 - Inventory Routing Problem. - Jean André; Eric Bourreau; Roberto Wolfler Calvo (Transp. Sci., 2020)

Optimal Solution of Vehicle Routing Problems with Fractional Objective Function. - Roberto Baldacci; Andrew Lim 001; Emiliano Traversi; Roberto Wolfler Calvo (Transp. Sci., 2020)

Machine Learning Guided Optimization for Demand Responsive Transport Systems. - Louis Zigrand; Pegah Alizadeh; Emiliano Traversi; Roberto Wolfler Calvo (ECML/PKDD (4), 2021)

A branch-and-price algorithm for the Minimum Sum Coloring Problem. - Diego Delle Donne; Fabio Furini; Enrico Malaguti; Roberto Wolfler Calvo (Discret. Appl. Math., 2021)

A route decomposition approach for the single commodity Split Pickup and Split Delivery Vehicle Routing Problem. - Marco Casazza; Alberto Ceselli; Roberto Wolfler Calvo (Eur. J. Oper. Res., 2021)

A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques. - Timo Gschwind; Stefan Irnich; Fabio Furini; Roberto Wolfler Calvo (INFORMS J. Comput., 2021)

A Benders squared (B2) framework for infinite-horizon stochastic linear programs. - Giacomo Nannicini; Emiliano Traversi; Roberto Wolfler Calvo (Math. Program. Comput., 2021)

Preface: Special issue on freight transportation and logistics. - Massimo Di Francesco; Enrico Gorgone; Roberto Wolfler Calvo; Paola Zuddas (Networks, 2021)

Efficient formulations for the traveling car renter problem and its quota variant. - Mathieu Lacroix 001; Yasmín Á. Ríos-Solís; Roberto Wolfler Calvo (Optim. Lett., 2021)

A constraints-aware Reweighted Feasibility Pump approach. - Antonio Frangioni; Stefania Pan; Emiliano Traversi; Roberto Wolfler Calvo (Oper. Res. Lett., 2021)

The Schrijver system of the flow cone in series-parallel graphs. - Michele Barbato; Roland Grappe; Mathieu Lacroix 001; Emiliano Lancini; Roberto Wolfler Calvo (Discret. Appl. Math., 2022)

Robustness of solutions to the capacitated facility location problem with uncertain demand. - Roberto Baldacci; Marco Caserta; Emiliano Traversi; Roberto Wolfler Calvo (Optim. Lett., 2022)

Optimization-driven Demand Prediction Framework for Suburban Dynamic Demand-Responsive Transport Systems. - Louis Zigrand; Roberto Wolfler Calvo; Emiliano Traversi; Pegah Alizadeh (IJCAI, 2023)

Hard problems on box-totally dual integral polyhedra. - Patrick Chervet; Roland Grappe; Mathieu Lacroix 001; Francesco Pisanu; Roberto Wolfler Calvo (Discret. Optim., 2023)

The Multi-commodity Flow Problem: Double Dantzig-Wolfe decomposition. - Fan Zhang 016; Jiazheng Wang; Mathieu Lacroix 001; Roberto Wolfler Calvo; Youcef Magnouche; Sébastien Martin (CoDIT, 2024)

A trust-region framework for derivative-free mixed-integer optimization. - Juan José Torres Figueroa; Giacomo Nannicini; Emiliano Traversi; Roberto Wolfler Calvo (Math. Program. Comput., 2024)

Multi-day routes in a multi-depot vehicle routing problem with intermediate replenishment facilities and time windows. - Matteo Avolio; Massimo Di Francesco; Antonio Fuduli; Enrico Gorgone; Roberto Wolfler Calvo (Comput. Oper. Res., 2025)