Bike sharing systems: Solving the static rebalancing problem
Top Cited Papers
- 1 May 2013
- journal article
- Published by Elsevier BV in Discrete Optimization
- Vol. 10 (2), 120-146
- https://doi.org/10.1016/j.disopt.2012.11.005
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problemEuropean Journal of Operational Research, 2012
- Balancing the stations of a self service “bike hire” systemRAIRO - Operations Research, 2011
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problemComputers & Operations Research, 2009
- A branch‐and‐cut algorithm for the nonpreemptive swapping problemNaval Research Logistics (NRL), 2009
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithmsNetworks, 2007
- A branch-and-cut algorithm for a traveling salesman problem with pickup and deliveryDiscrete Applied Mathematics, 2004
- Separating capacity constraints in the CVRP using tabu searchEuropean Journal of Operational Research, 1998
- The swapping problemNetworks, 1992
- Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraintsOperations Research Letters, 1991
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972