The static bicycle relocation problem with demand intervals
Open Access
- 1 October 2014
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 238 (2), 451-457
- https://doi.org/10.1016/j.ejor.2014.04.013
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Bike sharing systems: Solving the static rebalancing problemDiscrete Optimization, 2013
- A branch‐and‐cut algorithm for the preemptive swapping problemNetworks, 2011
- Balancing the stations of a self service “bike hire” systemRairo-Operations Research, 2011
- A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping ProblemDiscrete Applied Mathematics, 2010
- A branch‐and‐cut algorithm for the nonpreemptive swapping problemNaval Research Logistics (NRL), 2009
- Heuristics for the mixed swapping problemComputers & Operations Research, 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
- The swapping problemNetworks, 1992
- Facet identification for the symmetric traveling salesman polytopeMathematical Programming, 1990