| Robustness of solutions to the capacitated facility location problem with uncertain demand | 0 | 0.34 | 2022 |
| A route decomposition approach for the single commodity Split Pickup and Split Delivery Vehicle Routing Problem | 0 | 0.34 | 2021 |
| A Constraints-Aware Reweighted Feasibility Pump Approach | 0 | 0.34 | 2021 |
| Machine Learning Guided Optimization for Demand Responsive Transport Systems | 0 | 0.34 | 2021 |
| A Benders squared (B-2) framework for infinite-horizon stochastic linear programs | 0 | 0.34 | 2021 |
| A Branch-And-Price Algorithm For The Minimum Sum Coloring Problem | 0 | 0.34 | 2021 |
| Introduction to the Special Section: ROADEF/EURO Challenge 2016—Inventory Routing Problem | 1 | 0.34 | 2020 |
| An exact algorithm for robust influence maximization | 0 | 0.34 | 2020 |
| A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints | 0 | 0.34 | 2019 |
| An Exact Algorithm For Robust Influence Maximization | 0 | 0.34 | 2019 |
| A hybrid heuristic for the multi-activity tour scheduling problem. | 1 | 0.36 | 2018 |
| A new effective unified model for solving the Pre-marshalling and Block Relocation Problems. | 1 | 0.35 | 2018 |
| A branch and price approach for the Split Pickup and Split Delivery VRP. | 1 | 0.37 | 2018 |
| Shared mobility systems: an updated survey. | 1 | 0.36 | 2018 |
| The multiple vehicle balancing problem. | 1 | 0.44 | 2018 |
| Preface: Emerging challenges in transportation planning. | 0 | 0.34 | 2018 |
| The Vehicle Routing Problem with Transhipment Facilities. | 1 | 0.35 | 2017 |
| The Multicommodity-Ring Location Routing Problem | 3 | 0.37 | 2016 |
| Fast machine reassignment | 0 | 0.34 | 2016 |
| Dependency Parsing With Bounded Block Degree And Well-Nestedness Via Lagrangian Relaxation And Branch-And-Bound | 0 | 0.34 | 2016 |
| Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks. | 2 | 0.38 | 2016 |
| A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities | 0 | 0.34 | 2016 |
| Shared mobility systems | 14 | 0.66 | 2015 |
| An exact algorithm for the static rebalancing problem arising in bicycle sharing systems. | 17 | 1.15 | 2015 |
| The static bicycle relocation problem with demand intervals. | 15 | 0.74 | 2014 |
| Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks | 3 | 0.46 | 2014 |
| An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem. | 30 | 0.85 | 2013 |
| An analytical approach to calculate the capacity of a railway system. | 5 | 0.62 | 2013 |
| Solving the electricity production planning problem by a column generation based heuristic | 5 | 0.49 | 2013 |
| Efficient algorithms for the 2-Way Multi Modal Shortest Path Problem. | 2 | 0.56 | 2013 |
| Bike sharing systems: Solving the static rebalancing problem. | 75 | 3.83 | 2013 |
| A matheuristic approach for solving a home health care problem. | 12 | 0.62 | 2013 |
| New Lower Bounds and Exact Method for the m-PVRP | 2 | 0.37 | 2013 |
| The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search. | 55 | 1.40 | 2012 |
| A label correcting algorithm for the shortest path problem on a multi-modal route network | 2 | 0.45 | 2012 |
| Hybridized evolutionary local search algorithm for the team orienteering problem with time windows. | 29 | 1.02 | 2011 |
| A Branch-and-Cut method for the Capacitated Location-Routing Problem | 26 | 1.01 | 2011 |
| UniALT for regular language contrained shortest paths on a multi-modal transportation network. | 1 | 0.35 | 2011 |
| An Exact Method for the Capacitated Location-Routing Problem | 35 | 1.21 | 2011 |
| A matheuristic for the dial-a-ride problem | 2 | 0.35 | 2011 |
| Approximating the metric 2-Peripatetic Salesman Problem | 0 | 0.34 | 2010 |
| Lower and upper bounds for the m-peripatetic vehicle routing problem. | 11 | 0.59 | 2010 |
| An effective hybrid evolutionary local search for orienteering and team orienteering problems with time windows | 3 | 0.42 | 2010 |
| An effective memetic algorithm for the cumulative capacitated vehicle routing problem | 65 | 2.11 | 2010 |
| An Effective Evolutionary Algorithm for the Cumulative Capacitated Vehicle Routing Problem | 0 | 0.34 | 2009 |
| On the Complexity of the Multiple Stack TSP, kSTSP | 11 | 0.62 | 2009 |
| A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem | 65 | 2.10 | 2008 |
| Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic | 81 | 2.86 | 2007 |
| An effective and fast heuristic for the Dial-a-Ride problem | 14 | 1.08 | 2007 |
| Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem | 7 | 0.50 | 2006 |
