Team, Visitors, External Collaborators
Overall Objectives
Research Program
Application Domains
Highlights of the Year
New Software and Platforms
New Results
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub


Bibliography

Publications of the year

Doctoral Dissertations and Habilitation Theses

[1]
I. Ben Mohamed.
Designing two-echelon distribution networks under uncertainty, Université de Bordeaux, May 2019.
https://hal.archives-ouvertes.fr/tel-02163466
[2]
R. Sadykov.
Modern Branch-Cut-and-Price, Université de Bordeaux, December 2019, Habilitation à diriger des recherches.
https://hal.inria.fr/tel-02410101

Articles in International Peer-Reviewed Journals

[3]
O. Beaumont, B. A. Becker, A. Deflumere, L. Eyraud-Dubois, T. Lambert, A. Lastovetsky.
Recent Advances in Matrix Partitioning for Parallel Computing on Heterogeneous Platforms, in: IEEE Transactions on Parallel and Distributed Systems, January 2019, vol. 30, no 1, 11 p. [ DOI : 10.1109/TPDS.2018.2853151 ]
https://hal.inria.fr/hal-01670672
[4]
I. Ben Mohamed, W. Klibi, F. Vanderbeck.
Designing a Two-Echelon Distribution Network under Demand Uncertainty, in: European Journal of Operational Research, 2019, vol. 280, no 1, pp. 102-123, forthcoming. [ DOI : 10.1016/j.ejor.2019.06.047 ]
https://hal.archives-ouvertes.fr/hal-02167587
[5]
F. Clautiaux, J. Guillot, P. Pesneau.
Exact approaches for solving a covering problem with capacitated subtrees, in: Computers and Operations Research, May 2019, vol. 105, pp. 85-101, Experiments presented in this paper were carried out using the PLAFRIM experimental testbed, being developed under the Inria PlaFRIM development action with support from Bordeaux INP, LABRI and IMB and other entities: Conseil Régional d’Aquitaine, Université de Bordeaux, CNRS and ANR in accordance to the programmed’investissements d’Avenir (seehttps://www.plafrim.fr/). [ DOI : 10.1016/j.cor.2019.01.008 ]
https://hal.inria.fr/hal-02053563
[6]
F. Clautiaux, R. Sadykov, F. Vanderbeck, Q. Viaud.
Pattern based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers, in: EURO Journal on Computational Optimization, September 2019, vol. 7, no 3, pp. 265–297. [ DOI : 10.1007/s13675-019-00113-9 ]
https://hal.archives-ouvertes.fr/hal-01656179
[7]
G. Marques, R. Sadykov, J.-C. Deschamps, R. Dupas.
An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem, in: Computers and Operations Research, 2019, vol. 114. [ DOI : 10.1016/j.cor.2019.104833 ]
https://hal.archives-ouvertes.fr/hal-02112287
[8]
A. A. Pessoa, R. Sadykov, E. Uchoa, F. Vanderbeck.
A Generic Exact Solver for Vehicle Routing and Related Problems, in: Lecture Notes in Computer Science, 2019, vol. 11480, pp. 354-369. [ DOI : 10.1007/978-3-030-17953-3_27 ]
https://hal.inria.fr/hal-02178171
[9]
R. Sadykov, F. Vanderbeck, A. A. Pessoa, I. Tahiri, E. Uchoa.
Primal Heuristics for Branch-and-Price: the assets of diving methods, in: INFORMS Journal on Computing, 2019, vol. 31, no 2, pp. 251-267. [ DOI : 10.1287/ijoc.2018.0822 ]
https://hal.inria.fr/hal-01237204

Invited Conferences

[10]
A. Froger, O. Jabali, J. E. Mendoza, G. Laporte.
A matheuristic algorithm to solve the electric vehicle routing problem with capacitated charging stations, in: SynchroTrans 2019 - 2nd International Workshop on Synchronisation in Transport, Nantes, France, September 2019.
https://hal.archives-ouvertes.fr/hal-02373191
[11]
R. Sadykov, A. A. Pessoa, E. Uchoa.
A Bucket Graph Based Labelling Algorithm for Vehicle Routing Pricing, in: POC Autumn School on Advanced BCP Tools, Paris, France, November 2019.
https://hal.inria.fr/hal-02378624
[12]
R. Sadykov.
Tutorial: Modern Branch-and-Cut-and-Price for Vehicle Routing Problems Plan of the talk, in: INOC 2019 - 9th International Network Optimization Conference, Avignon, France, June 2019.
https://hal.inria.fr/hal-02378638

International Conferences with Proceedings

[13]
G. Aupy, O. Beaumont, L. Eyraud-Dubois.
Sizing and Partitioning Strategies for Burst-Buffers to Reduce IO Contention, in: IPDPS 2019 - 33rd IEEE International Parallel and Distributed Processing Symposium, Rio de Janeiro, Brazil, May 2019.
https://hal.inria.fr/hal-02141616
[14]
N. Kukreja, A. Shilova, O. Beaumont, J. Hückelheim, N. Ferrier, P. Hovland, G. Gorman.
Training on the Edge: The why and the how, in: PAISE2019 - 1st Workshop on Parallel AI and Systems for the Edge, Rio de Janeiro, Brazil, May 2019.
https://hal.inria.fr/hal-02069728
[15]
A. Tomassilli, G. Di Lena, F. Giroire, I. Tahiri, D. Saucez, S. Pérennes, T. Turletti, R. Sadykov, F. Vanderbeck, C. Lac.
Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks, in: CloudNet 2019 - 8th IEEE International Conference on Cloud Networking, Coimbra, Portugal, November 2019.
https://hal.inria.fr/hal-02292971

Conferences without Proceedings

[16]
I. Ben Mohamed, W. Klibi, R. Sadykov, H. Sen, F. Vanderbeck.
A Benders Approach for the Two-echelon Stochastic Multi-period Capacitated Location-Routing Problem, in: Roadef 2019 - 20ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Le Havre, France, February 2019.
https://hal.archives-ouvertes.fr/hal-02163464
[17]
M. Benkirane, F. Clautiaux, J. Damay, B. Detienne.
Un modèle hypergraphe pour le problème de roulement matériel et sélection d'horaires de trains, in: Roadef 2019 - 20ème Congrès Annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Le Havre, France, February 2019.
https://hal.archives-ouvertes.fr/hal-02407686
[18]
F. Clautiaux, R. Sadykov, O. Rivera-Letelier.
Bin Packing Problem with Generalized Time Lags: A Branch-Cut-and-Price Approach, in: Roadef 2019 - 20ème Congrès Annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Le Havre, France, February 2019.
https://hal.inria.fr/hal-02378993
[19]
B. Detienne, A. N. Arslan.
A Decomposition-Based Approach For A Class Of Two-Stage Robust Binary Optimization Problems, in: ICSP2019 - XV International Conference on Stochastic Programming, Trondheim, Norway, July 2019.
https://hal.archives-ouvertes.fr/hal-02407421
[20]
P. Liguori, R. Mahjoub, R. Sadykov, E. Uchoa.
A Branch-Cut-and-Price Algorithm for the Location-Routing Problem, in: TRISTAN X - The Tenth Triennial Symposium on Transportation Analysis, Hamilton Island, Australia, June 2019.
https://hal.inria.fr/hal-02378977
[21]
E. Queiroga, Y. Frota, R. Sadykov, A. Subramanian, E. Uchoa, T. Vidal.
Branch-cut-and-price algorithms for the vehicle routing problem with backhauls, in: VeRoLog 2019 - 7th Workshop of the EURO Working Group on Vehicle Routing and Logistics optimization, Seville, Spain, June 2019.
https://hal.inria.fr/hal-02378983

Internal Reports

[22]
E. Queiroga, Y. Frota, R. Sadykov, A. Subramanian, E. Uchoa, T. Vidal.
On the exact solution of vehicle routing problems with backhauls, Universidade Federal Fluminense, August 2019, no Cadernos do LOGIS 2019/3.
https://hal.inria.fr/hal-02379008
[23]
A. Tomassilli, G. Di Lena, F. Giroire, I. Tahiri, D. Saucez, S. Perennes, T. Turletti, R. Sadykov, F. Vanderbeck, C. Lac.
Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks, Inria Sophia Antipolis - I3S, April 2019.
https://hal.inria.fr/hal-02112282

Software

[24]
S. Archipoff, C. Augonnet, O. Aumage, G. Beauchamp, B. Bramas, A. Buttari, A. Cassagne, J. Clet-Ortega, T. Cojean, N. Collin, V. Danjean, A. Denis, L. Eyraud-Dubois, N. Furmento, S. Henry, A. Hugo, M. Juhoor, A. Juven, M. Keryell-Even, Y. Khorsi, T. Lambert, E. Leria, B. Lizé, M. Makni, S. Nakov, R. Namyst, L. Nesi Lucas, J. Pablo, D. Pasqualinotto, S. Pitoiset, N. Quôc-Dinh, C. Roelandt, C. Sakka, C. Salingue, M. Schnorr Lucas, M. Sergent, A. Simonet, L. Stanisic, S. Bérangère, F. Tessier, S. Thibault, V. Brice, L. Villeveygoux, P.-A. Wacrenier.
StarPU, January 2020, Version : 1.3.3,
[ SWH-ID : swh:1:dir:b6e19d99449a78805e7a55a341fbaba2bc431973 ]
, Software.
https://hal.inria.fr/hal-02443512

Other Publications

[25]
A. N. Arslan, B. Detienne.
Decomposition-based approaches for a class of two-stage robust binary optimization problems, July 2019, working paper or preprint.
https://hal.inria.fr/hal-02190059
[26]
I. Ben Mohamed, W. Klibi, R. Sadykov, H. Şen, F. Vanderbeck.
A Benders Decomposition Approach for the Two-Echelon Stochastic Multi-period Capacitated Location-Routing Problem, July 2019, working paper or preprint.
https://hal.archives-ouvertes.fr/hal-02178459
[27]
M. Benkirane, F. Clautiaux, J. Damay, B. Detienne.
A Hypergraph Model for the Rolling Stock Rotation Planning and Train Selection, December 2019, working paper or preprint.
https://hal.inria.fr/hal-02402447
[28]
F. Clautiaux, B. Detienne, G. Guillot.
An iterative dynamic programming approach for the temporal knapsack problem, November 2019, working paper or preprint.
https://hal.archives-ouvertes.fr/hal-02044832
[29]
A. Froger, J. E. Mendoza, O. Jabali, G. Laporte.
The electric vehicle routing problem with capacitated charging stations, November 2019, working paper or preprint.
https://hal.archives-ouvertes.fr/hal-02386167
[30]
A. Tomassilli, G. Di Lena, F. Giroire, I. Tahiri, S. Pérennes, D. Saucez, T. Turletti, R. Sadykov, F. Vanderbeck, C. Lac.
Poster: Design of Survivable SDN/NFV-enabled Networks with Bandwidth-optimal Failure Recovery, May 2019, NETWORKING 2019 - IFIP Networking conference, Poster.
https://hal.inria.fr/hal-02364488
References in notes
[31]
K. Akartunali, A. J. Miller.
A Computational Analysis of Lower Bounds for Big Bucket Production Planning Problems, 2009.
http://hal.archives-ouvertes.fr/hal-00387105/en/
[32]
K. Akartunali, A. J. Miller.
A heuristic approach for big bucket multi-level production planning problems, in: European Journal of Operational Research, 2009, pp. 396-411.
http://hal.archives-ouvertes.fr/hal-00387052/en/
[33]
M. Alba Martínez, F. Clautiaux, M. Dell'Amico, M. Iori.
Exact algorithms for the bin packing problem with fragile objects, in: Discrete Optimization, August 2013, vol. 10, no 3, pp. 210-223. [ DOI : 10.1016/j.disopt.2013.06.001 ]
http://hal.inria.fr/hal-00909480
[34]
P. Baptiste, R. Sadykov.
On Scheduling a Single Machine to Minimize a Piecewise Linear Objective Function : A Compact MIP Formulation, in: Naval Research Logistics / Naval Research Logistics An International Journal, 2009, vol. 56, no 6, pp. 487–502.
http://hal.inria.fr/inria-00387012/en/
[35]
P. Baptiste, R. Sadykov.
Time Indexed Formulations for Scheduling Chains on a Single Machine: An Application to Airborne Radars, in: European Journal of Operational Research, 2009.
http://hal.inria.fr/inria-00339639/en/
[36]
O. Beaumont, B. A. Becker, A. Deflumere, L. Eyraud-Dubois, T. Lambert, A. Lastovetsky.
Recent Advances in Matrix Partitioning for Parallel Computing on Heterogeneous Platforms, December 2017, working paper or preprint.
https://hal.inria.fr/hal-01670672
[37]
O. Beaumont, L. Eyraud-Dubois, S. Kumar.
Approximation Proofs of a Fast and Efficient List Scheduling Algorithm for Task-Based Runtime Systems on Multicores and GPUs, October 2016, working paper or preprint.
https://hal.inria.fr/hal-01386174
[38]
F. Clautiaux, R. Sadykov, F. Vanderbeck, Q. Viaud.
Pattern based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers, Université de Bordeaux, December 2017, pp. 1-30.
https://hal.archives-ouvertes.fr/hal-01656179
[39]
M. Constantino, A. J. Miller, M. Van Vyve.
Mixing MIR Inequalities with Two Divisible Coefficients, in: Mathematical Programming, Series A, 2009, pp. 1–1.
http://hal.archives-ouvertes.fr/hal-00387098/en/
[40]
B. Denton, A. J. Miller, H. Balasubramanian, T. Huschka.
Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty, in: Operations Research, 2009, pp. 1–1.
http://hal.archives-ouvertes.fr/hal-00386469/en/
[41]
B. Detienne.
Extended formulations for robust maintenance planning at power plants, in: Gaspard Monge Program for Optimization : Conference on Optimization and Practices in Industry PGMO-COPI14, Saclay, France, October 2014.
https://hal.inria.fr/hal-01104728
[42]
L. Eyraud-Dubois, T. Lambert.
Using Static Allocation Algorithms for Matrix Matrix Multiplication on Multicores and GPUs, December 2017, working paper or preprint.
https://hal.inria.fr/hal-01670678
[43]
M. T. Godinho, L. Gouveia, T. L. Magnanti, P. Pesneau, J. Pires.
On a Time-Dependent Model for the Unit Demand Vehicle Routing Problem, Centro de Investigacao Operacional da Universidade de Lisboa, 2007, no 11-2007.
[44]
M. T. Godinho, L. Gouveia, T. L. Magnanti, P. Pesneau, J. Pires.
On Time-Dependent Model for Unit Demand Vehicle Routing Problems, in: International Conference on Network Optimization, INOC, International Network Optimization Conference (INOC), 2007.
[45]
R. Griset, P. Bendotti, B. Detienne, H. Grevet, M. Porcheron, F. Vanderbeck.
Scheduling nuclear outage with cut and price (Snowcap), in: Mathematical Optimization in the Decision Support Systems for Efficient and Robust Energy Networks Final Conference, Modena, Italy, March 2017.
https://hal.inria.fr/hal-01670278
[46]
R. Griset, P. Bendotti, B. Detienne, H. Grevet, M. Porcheron, H. Şen, F. Vanderbeck.
Efficient formulations for nuclear outages using price and cut, Snowcap project., in: PGMO Days 2017, Saclay, France, November 2017.
https://hal.inria.fr/hal-01670252
[47]
R. Griset.
Optimisation des arrêts nucléaires : une amélioration des solutions développées par EDF suite au challenge ROADEF 2010, in: 18ème conférence de la société française de recherche opérationnelle et d'aide à la décision ROADEF 2017, Metz, France, February 2017.
https://hal.inria.fr/hal-01670237
[48]
Y. Guan, S. Ahmed, A. J. Miller, G. Nemhauser.
On formulations of the stochastic uncapacitated lot-sizing problem, in: Operations Research Letters, 2006, vol. 34, pp. 241-250.
[49]
Y. Guan, S. Ahmed, G. Nemhauser, A. J. Miller.
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem, in: Mathematical Programming, 2006, vol. 105, pp. 55-84.
[50]
L. Gély, G. Dessagne, P. Pesneau, F. Vanderbeck.
A multi scalable model based on a connexity graph representation, in: 11th International Conference on Computer Design and Operation in the Railway and Other Transit Systems COMPRAIL'08, Toledo, Spain, September 2008.
[51]
L. Gély.
Real-time train scheduling at SNCF, in: 1st Workshop on Robust Planning and Rescheduling in Railways, ARRIVAL meeting on Robust planning and Rescheduling in Railways, April 2007.
[52]
J. Han, P. Bendotti, B. Detienne, G. Petrou, M. Porcheron, R. Sadykov, F. Vanderbeck.
Extended Formulation for Maintenance Planning at Power Plants, in: ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Bordeaux, France, Société française de recherche opérationnelle et d'aide à la décision, February 2014.
https://hal.archives-ouvertes.fr/hal-00946294
[53]
Y. Hendel, R. Sadykov.
Timing problem for scheduling an airborne radar, in: Proceedings of the 11th International Workshop on Project Management and Scheduling, Istanbul, Turkey, April 2008, pp. 132-135.
[54]
D. Huygens, M. Labbé, A. R. Mahjoub, P. Pesneau.
The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut, in: Networks, 2007, vol. 49, no 1, pp. 116-133.
[55]
C. Joncour.
Problèmes de placement 2D et application à l'ordonnancement : modélisation par la théorie des graphes et approches de programmation mathématique, University Bordeaux I, December 2010.
[56]
C. Joncour, A. Pêcher, P. Pesneau, F. Vanderbeck.
Mathematical programming formulations for the orthogonal 2d knapsack problem, in: Livre des résumé du 9ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, February 2008, pp. 255–256.
http://hal.archives-ouvertes.fr/hal-00307152/en/
[57]
C. Joncour, A. Pêcher.
Consecutive ones matrices for multi-dimensional orthogonal packing problems, in: Journal of Mathematical Modelling and Algorithms, 2012, vol. 11, no 1, pp. 23-44. [ DOI : 10.1007/s10852-011-9167-z ]
http://hal.inria.fr/hal-00652574
[58]
C. Joncour, A. Pêcher, P. Valicov.
MPQ-trees for the orthogonal packing problem, in: Journal of Mathematical Modelling and Algorithms, March 2012, vol. 11, no 1, pp. 3-22. [ DOI : 10.1007/s10852-011-9159-z ]
http://hal.archives-ouvertes.fr/hal-00611528
[59]
P. Meurdesoif, P. Pesneau, F. Vanderbeck.
Meter installation for monitoring network traffic, in: International Conference on Network Optimization, INOC, International Network Optimization Conference (INOC), 2007.
[60]
P. Meurdesoif, P. Pesneau, F. Vanderbeck.
A Branch­-and­-Cut algorithm to optimize sensor installation in a network, in: Graph and Optimization Meeting GOM2008, France Saint-Maximin, 2008.
[61]
S. Michel, N. Perrot, F. Vanderbeck.
Knapsack Problems with Setups, in: European Journal of Operational Research, 2009, vol. 196, pp. 909-918.
http://hal.inria.fr/inria-00232782/en/
[62]
S. Michel, F. Vanderbeck.
A Column Generation based Tactical Planning Method for Inventory Routing, Inria, 2008.
http://hal.inria.fr/inria-00169311/en/
[63]
S. Michel, F. Vanderbeck.
A Column Generation based Tactical Planning Method for Inventory Routing, in: Operations Research, 2012, vol. 60, no 2, pp. 382-397.
http://hal.inria.fr/inria-00169311
[64]
M. Mourgaya, F. Vanderbeck.
Column generation based heuristic for tactical planning in multi period vehicle routing, in: European Journal of Operational Research, 2007, vol. 183, no 3, pp. 1028-1041.
[65]
M. Padberg, G. Rinaldi.
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, in: SIAM Review, 1991, vol. 33, no 1, pp. 60–100.
[66]
P. Pesneau, F. Clautiaux, J. Guillot.
Aggregation technique applied to a clustering problem for waste collection, in: ROADEF 2016, Compiègne, France, February 2016.
https://hal.inria.fr/hal-01418346
[67]
P. Pesneau, F. Clautiaux, J. Guillot.
Aggregation technique applied to a clustering problem, in: 4th International Symposium on Combinatorial Optimization (ISCO 2016), Vietri sul Mare, Italy, May 2016.
https://hal.inria.fr/hal-01418337
[68]
M. Poggi, D. Pecin, M. Reis, C. Ferreira, K. Neves, R. Sadykov, F. Vanderbeck.
Equipment/Operator task scheduling with BAPCOD, in: Column Generation 2012, Bromont, Canada, June 2012.
http://hal.inria.fr/hal-00750575
[69]
N. Rahmani, B. Detienne, R. Sadykov, F. Vanderbeck.
A Column Generation Based Heuristic for the Dial-A-Ride Problem, in: International Conference on Information Systems, Logistics and Supply Chain (ILS), Bordeaux, France, June 2016.
https://hal.inria.fr/hal-01425755
[70]
R. Sadykov.
A branch-and-check algorithm for minimizing the sum of the weights of the late jobs on a single machine with release dates, in: European Journal of Operations Research, 2008, vol. 189, no 3, pp. 1284–1304.
http://dx.doi.org/10.1016/j.ejor.2006.06.078
[71]
R. Sadykov.
A polynomial algorithm for a simple scheduling problem at cross docking terminals, Inria, 2009, RR-7054.
http://hal.inria.fr/inria-00412519/en/
[72]
R. Sadykov.
On scheduling malleable jobs to minimise the total weighted completion time, in: 13th IFAC Symposium on Information Control Problems in Manufacturing, Russie Moscow, 2009.
http://hal.inria.fr/inria-00339646/en/
[73]
R. Sadykov.
Scheduling incoming and outgoing trucks at cross docking terminals to minimize the storage cost, in: Annals of Operations Research, 2012, vol. 201, no 1, pp. 423-440. [ DOI : 10.1007/s10479-012-1232-0 ]
http://hal.inria.fr/inria-00539849
[74]
R. Sadykov, F. Vanderbeck.
Bin Packing with conflicts: a generic branch-and-price algorithm, in: INFORMS Journal on Computing, 2013, vol. 25, no 2, pp. 244-255. [ DOI : 10.1287/ijoc.1120.0499 ]
http://hal.inria.fr/inria-00539869
[75]
G. Stauffer.
The p-median Polytope of Y-free Graphs: An Application of the Matching Theory, in: Operations Research Letters, 2008.
http://hal.inria.fr/inria-00442282
[76]
B. Vignac, B. Jaumard, F. Vanderbeck.
Hierarchical Heuristic for the GRWA Problem in WDM Networks with Delay Constraints, Inria, 2009, 18 p.
http://hal.inria.fr/inria-00415513/en/
[77]
B. Vignac, F. Vanderbeck, B. Jaumard.
Nested Decomposition Approach to an Optical Network Design Problem, Inria, 2009, 18 p.
http://hal.inria.fr/inria-00415500/en/
[78]
B. Vignac, F. Vanderbeck, B. Jaumard.
Reformulation and Decomposition Approaches for Traffic Routing in Optical Networks, Inria, 2009, 36 p.
http://www.math.u-bordeaux.fr/~fv/papers/grwaWP.pdf
[79]
B. Vignac.
Résolution d'un problème de groupage dans le réseaux optiques maillés, Université de Montréal, January 2010.