Zobrazeno 1 - 10
of 57
pro vyhledávání: '"François Vanderbeck"'
Publikováno v:
EURO Journal on Computational Optimization, Vol 7, Iss 3, Pp 265-297 (2019)
In the two-dimensional guillotine cutting-stock problem, the objective is to minimize the number of large plates used to cut a list of small rectangles. We consider a variant of this problem, which arises in glass industry when different bills of ord
Externí odkaz:
https://doaj.org/article/6537fed784134269ab6d6f6bb13a340e
Autor:
Ruslan Sadykov, François Vanderbeck
Publikováno v:
EURO Journal on Computational Optimization, Vol 1, Iss 1, Pp 81-115 (2013)
Working in an extended variable space allows one to develop tighter reformulations for mixed integer programs. However, the size of the extended formulation grows rapidly too large for a direct treatment by a MIP-solver. Then, one can work with inner
Externí odkaz:
https://doaj.org/article/7d3a0c157efc41329107d521091858b3
Autor:
Halil Şen, Rodolphe Griset, François Vanderbeck, Boris Detienne, Marc Porcheron, Pascale Bendotti
Publikováno v:
European Journal of Operational Research
European Journal of Operational Research, Elsevier, In press, 298 (3), pp.1067-1083. ⟨10.1016/j.ejor.2021.07.018⟩
European Journal of Operational Research, In press, 298 (3), pp.1067-1083. ⟨10.1016/j.ejor.2021.07.018⟩
European Journal of Operational Research, Elsevier, In press, 298 (3), pp.1067-1083. ⟨10.1016/j.ejor.2021.07.018⟩
European Journal of Operational Research, In press, 298 (3), pp.1067-1083. ⟨10.1016/j.ejor.2021.07.018⟩
International audience; Optimizing nuclear unit outages is of significant economic importance for the French electricity company EDF, as these outages induce a substitute production by other more expensive means to fulfill electricity demand. This pr
Publikováno v:
European Journal of Operational Research
European Journal of Operational Research, 2022, ⟨10.1016/j.ejor.2022.07.022⟩
European Journal of Operational Research, 2022, ⟨10.1016/j.ejor.2022.07.022⟩
International audience; Given the emergence of two-echelon distribution systems in several practical contexts, this paper tackles, at the strategic level, a distribution network design problem under uncertainty. This problem is defined as the two-ech
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1a4ba8db31a75f09d386fc049737c23f
https://inria.hal.science/hal-02987266v2/document
https://inria.hal.science/hal-02987266v2/document
Publikováno v:
Mathematical Programming
Mathematical Programming, Springer Verlag, 2020, 183, pp.483-523. ⟨10.1007/s10107-020-01523-z⟩
Mathematical Programming, 2020, 183, pp.483-523. ⟨10.1007/s10107-020-01523-z⟩
Mathematical Programming, Springer Verlag, 2020, 183, pp.483-523. ⟨10.1007/s10107-020-01523-z⟩
Mathematical Programming, 2020, 183, pp.483-523. ⟨10.1007/s10107-020-01523-z⟩
Major advances were recently obtained in the exact solution of vehicle routing problems (VRPs). Sophisticated branch-cut-and-price (BCP) algorithms for some of the most classical VRP variants now solve many instances with up to a few hundreds of cust
Autor:
Thierry Turletti, Issam Tahiri, Ruslan Sadykov, Giuseppe Di Lena, Andrea Tomassilli, François Vanderbeck, Stéphane Pérennes, Frédéric Giroire, Damien Saucez, Chidung Lac
Publikováno v:
Computer Networks
Computer Networks, Elsevier, 2021, 192 (108043), ⟨10.1016/j.comnet.2021.108043⟩
Computer Networks, Elsevier, 2021, 192, ⟨10.1016/j.comnet.2021.108043⟩
Computer Networks, 2021, 192 (108043), ⟨10.1016/j.comnet.2021.108043⟩
Computer Networks, Elsevier, 2021, 192 (108043), ⟨10.1016/j.comnet.2021.108043⟩
Computer Networks, Elsevier, 2021, 192, ⟨10.1016/j.comnet.2021.108043⟩
Computer Networks, 2021, 192 (108043), ⟨10.1016/j.comnet.2021.108043⟩
International audience; More than ever, data networks have demonstrated their central role in the world economy, but also in the well-being of humanity that needs fast and reliable networks. In parallel, with the emergence of Network Function Virtual
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70d42a7b2b39a530180102a64874d756
https://hal.inria.fr/hal-03441630/file/2021-COMPNET-Global_Rerouting.pdf
https://hal.inria.fr/hal-03441630/file/2021-COMPNET-Global_Rerouting.pdf
Autor:
Andrea Tomassilli, Chidung Lac, Frédéric Giroire, Ruslan Sadykov, Stéphane Pérennes, Damien Saucez, Issam Tahiri, François Vanderbeck, Thierry Turletti, G. Di Lena
Publikováno v:
CloudNet 2019-8th IEEE International Conference on Cloud Networking
CloudNet 2019-8th IEEE International Conference on Cloud Networking, Nov 2019, Coimbra, Portugal
[Research Report] INRIA Sophia Antipolis-I3S. 2019
CloudNet
CloudNet 2019-8th IEEE International Conference on Cloud Networking, Nov 2019, Coimbra, Portugal
[Research Report] INRIA Sophia Antipolis-I3S. 2019
CloudNet
ISP networks are taking a leap forward thanks to emerging technologies such as Software Defined Networking(SDN) and Network Function Virtualization (NFV). Efficient algorithms considered too hard to be put in practice on legacy networks now have a se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a7ee41198cd587ba5eb7ab588ed94940
https://hal.inria.fr/hal-02292971/file/camera-ready-cloudnet.pdf
https://hal.inria.fr/hal-02292971/file/camera-ready-cloudnet.pdf
Publikováno v:
EURO Journal on Computational Optimization
EURO Journal on Computational Optimization, 2019, 7 (3), pp.265-297. ⟨10.1007/s13675-019-00113-9⟩
EURO Journal on Computational Optimization, Springer, 2019, 7 (3), pp.265-297. ⟨10.1007/s13675-019-00113-9⟩
EURO Journal on Computational Optimization, Vol 7, Iss 3, Pp 265-297 (2019)
EURO Journal on Computational Optimization, 2019, 7 (3), pp.265-297. ⟨10.1007/s13675-019-00113-9⟩
EURO Journal on Computational Optimization, Springer, 2019, 7 (3), pp.265-297. ⟨10.1007/s13675-019-00113-9⟩
EURO Journal on Computational Optimization, Vol 7, Iss 3, Pp 265-297 (2019)
In the two-dimensional guillotine cutting-stock problem, the objective is to minimize the number of large plates used to cut a list of small rectangles. We consider a variant of this problem, which arises in glass industry when different bills of ord
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::19782f5a12968caac4f20ce356a2ffe5
https://hal.science/hal-01656179/file/article.pdf
https://hal.science/hal-01656179/file/article.pdf
Autor:
Chidung Lac, G. Di Lena, Damien Saucez, Thierry Turletti, Stéphane Pérennes, Andrea Tomassilli, Issam Tahiri, François Vanderbeck, Ruslan Sadykov, Frédéric Giroire
Publikováno v:
Networking
NETWORKING 2019-IFIP Networking conference
NETWORKING 2019-IFIP Networking conference, May 2019, Warsaw, Poland
NETWORKING 2019-IFIP Networking conference
NETWORKING 2019-IFIP Networking conference, May 2019, Warsaw, Poland
International audience; ISP networks are taking a leap forward thanks to emerging technologies such as Software Defined Networking (SDN) and Network Function Virtualization (NFV). Efficient algorithms considered too hard to be put in practice on lega
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783030179526
IPCO
IPCO
Major advances were recently obtained in the exact solution of Vehicle Routing Problems (VRPs). Sophisticated Branch-Cut-and-Price (BCP) algorithms for some of the most classical VRP variants now solve many instances with up to a few hundreds of cust
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::98869f0e8fb314d62f885fc6e16792a5
https://doi.org/10.1007/978-3-030-17953-3_27
https://doi.org/10.1007/978-3-030-17953-3_27