Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods

Autor: Rui Sa Shibasaki, Philippe Mahey, Francisco Barahona, Mauricio C. de Souza, Mourad Baïou

Publikováno v: International Transactions in Operational Research
International Transactions in Operational Research, 2021, 28 (1), pp.296-326. ⟨10.1111/itor.12770⟩
International Transactions in Operational Research, Wiley, 2021, 28 (1), pp.296-326. ⟨10.1111/itor.12770⟩

International audience; The Bundle Method and the Volume Algorithm are among the most efficient techniques to obtain accurate Lagrangian dual bounds for hard combinatorial optimization problems. We propose here to compare their performance on very la

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3eba2380918c6968c220449548b6f5dd
https://hal.science/hal-03046371/file/ITOR.pdf

A survey on operator splitting and decomposition of convex programs

Autor: Arnaud Lenoir, Philippe Mahey

Publikováno v: RAIRO-Operations Research
RAIRO-Operations Research, EDP Sciences, 2017, 51 (1), pp.14-41. ⟨10.1051/ro/2015065⟩
RAIRO-Operations Research, 2017, 51 (1), pp.14-41. ⟨10.1051/ro/2015065⟩

International audience; Many structured convex minimization problems can be modeled by the search of a zero of the sum of two monotone operators. Operator splitting methods have been designed to decompose and regularize at the same time these kind of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::086854158db9f7facdb2d4fa3baf837d
https://doi.org/10.1051/ro/2015065

A Heuristic-Based Planner and Improved Controller for a Two-Layered Approach for the Game of Billiards

Autor: Jean-François Landry, Jean-Pierre Dussault, Philippe Mahey

Publikováno v: IEEE Transactions on Computational Intelligence and AI in games
IEEE Transactions on Computational Intelligence and AI in games, IEEE Computational Intelligence Society, 2013, 5 (4), pp.325-326. ⟨10.1109/TCIAIG.2013.2284385⟩
IEEE Transactions on Computational Intelligence and AI in games, 2013, 5 (4), pp.325-326. ⟨10.1109/TCIAIG.2013.2284385⟩

International audience; In [16] a two-layered approach was proposed to compute a winning strategy for the game of billiards. AI tools as well as robust optimization routines for noisy environments were combined to plan the sequence of shots. We compl

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b44264d2a7acc3c00bc010ddfbb69bf8
https://doi.org/10.1109/tciaig.2013.2284385

Hub-and-spoke network design and fleet deployment for string planning of liner shipping

Autor: Shahin Gelareh, Nelson Maculan, Philippe Mahey, Rahimeh Neamatian Monemi

Publikováno v: Applied Mathematical Modelling. 37(5):3307-3321

All shipping liner companies divide their service regions into several rotations (strings) in order to operate their container vessels. A string is the ordered set of ports at which a container vessel will call. Each port is usually called at no more

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::83d8c45d847932cfb3daad555cfc455c

Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem

Autor: Christophe Duhamel, Rodney R. Saldanha, Philippe Mahey, Alexandre Xavier Martins, Mauricio C. de Souza

Publikováno v: 4OR: A Quarterly Journal of Operations Research
4OR: A Quarterly Journal of Operations Research, Springer Verlag, 2016, 14, pp.201--220. ⟨10.1007/s10288-016-0309-z⟩
4OR: A Quarterly Journal of Operations Research, 2016, 14, pp.201--220. ⟨10.1007/s10288-016-0309-z⟩

The routing and wavelength assignment (RWA) problem typically occurs in wavelength division multiplexing optical networks. Given a number of available wavelengths, we consider here the problem of maximising the number of accepted connections with res

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac5f389b2e09bfffcf0569d86c954ba7
https://hal.archives-ouvertes.fr/hal-02090299