Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem.
Adam N. LetchfordJuan José Salazar GonzálezPublished in: Eur. J. Oper. Res. (2016)
Keyphrases
- multi commodity
- optimal solution
- heuristic solution
- miller tucker zemlin
- network flow problem
- facility location
- np hard
- mixed integer
- branch and bound
- feasible solution
- max min
- network design problem
- network design
- network flow
- exhaustive search
- minimum cost
- integer programming
- upper bound
- evolutionary algorithm
- search algorithm