A branch-and-bound algorithm for solving the static rebalancing problem in bicycle-sharing systems.
Ahmed Abdelmoumene KadriImed KacemKarim LabadiPublished in: Comput. Ind. Eng. (2016)
Keyphrases
- branch and bound algorithm
- search tree
- combinatorial optimization
- lower bound
- finding an optimal solution
- branch and bound
- np hard
- upper bound
- optimal solution
- variable ordering
- single machine scheduling problem
- test problems
- lagrangian relaxation
- lower bounding
- strongly np hard
- exact solution
- precedence constraints
- exact methods
- upper bounding