Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Mounira Groiez"'
Publikováno v:
EURO Journal on Computational Optimization, Vol 1, Iss 3, Pp 283-312 (2013)
We consider the multicommodity network flow formulation of the multiple depot vehicle scheduling problem (MDVSP) and investigate several strategies within a branch-and-cut framework for solving the MDVSP. In particular, we compare subalgorithms for s
Externí odkaz:
https://doaj.org/article/681475cce94b4a6ab9301d182c93da08
Publikováno v:
INFOR: Information Systems and Operational Research. 52:185-196
In this article we investigate some strategies for solving set partitioning problems (SPP), in particular the gains in computational efficiency that can be obtained by introducing cutting planes based on some rank-1 Chvatal-Gomory inequalities and cl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa60ab2446568a1a66b0806c3f2b683a
https://doi.org/10.3138/infor.52.4.185
https://doi.org/10.3138/infor.52.4.185
Publikováno v:
EURO Journal on Computational Optimization, Vol 1, Iss 3, Pp 283-312 (2013)
We consider the multicommodity network flow formulation of the multiple depot vehicle scheduling problem (MDVSP) and investigate several strategies within a branch-and-cut framework for solving the MDVSP. In particular, we compare subalgorithms for s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8899662d44110b4360eb26f3208637ab
http://www.sciencedirect.com/science/article/pii/S2192440621000228
http://www.sciencedirect.com/science/article/pii/S2192440621000228