Bibliography

Publications of the year

Articles in International Peer-Reviewed Journals

• 1O. 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, July 2018. [ DOI : 10.1109/TPDS.2018.2853151 ]
  https://hal.inria.fr/hal-01670672
• 2O. Beaumont, L. Eyraud-Dubois, S. Kumar.
  Fast Approximation Algorithms for Task-Based Runtime Systems, in: Concurrency and Computation: Practice and Experience, September 2018, vol. 30, n^o 17. [ DOI : 10.1002/cpe.4502 ]
  https://hal.inria.fr/hal-01878606
• 3F. Clautiaux, R. Sadykov, F. Vanderbeck, Q. Viaud.
  Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem, in: Discrete Optimization, February 2018, vol. 29, pp. 18-44. [ DOI : 10.1016/j.disopt.2018.02.003 ]
  https://hal.inria.fr/hal-01426690
• 4E. Kayaaslan, T. Lambert, L. Marchal, B. Uçar.
  Scheduling series-parallel task graphs to minimize peak memory, in: Theoretical Computer Science, January 2018, vol. 707, pp. 1-23. [ DOI : 10.1016/j.tcs.2017.09.037 ]
  https://hal.inria.fr/hal-01891937
• 5A. A. Pessoa, R. Sadykov, E. Uchoa.
  Enhanced Branch-Cut-and-Price Algorithm for Heterogeneous Fleet Vehicle Routing Problems, in: European Journal of Operational Research, October 2018, vol. 270, n^o 2, pp. 530-543. [ DOI : 10.1016/j.ejor.2018.04.009 ]
  https://hal.inria.fr/hal-01664844
• 6A. A. Pessoa, R. Sadykov, E. Uchoa, F. Vanderbeck.
  Automation and combination of linear-programming based stabilization techniques in column generation, in: INFORMS Journal on Computing, 2018, vol. 30, n^o 2, pp. 339-360. [ DOI : 10.1287/ijoc.2017.0784 ]
  https://hal.inria.fr/hal-01077984
• 7R. Sadykov, T. Bulhoes, E. Uchoa.
  A branch-and-price algorithm for the Minimum Latency Problem, in: Computers and Operations Research, May 2018, vol. 93, pp. 66-78. [ DOI : 10.1016/j.cor.2018.01.016 ]
  https://hal.inria.fr/hal-01664835
• 8R. 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, January 2018.
  https://hal.inria.fr/hal-01237204
• 9W. Van Ackooij, J. De Boeck, B. Detienne, S. Pan, M. Poss.
  Optimizing power generation in the presence of micro-grids, in: European Journal of Operational Research, May 2018, vol. 271, n^o 2, pp. 450-461. [ DOI : 10.1016/j.ejor.2018.05.042 ]
  https://hal.archives-ouvertes.fr/hal-01836057

International Conferences with Proceedings

• 10G. Aupy, O. Beaumont, L. Eyraud-Dubois.
  What Size Should your Buffers to Disks be?, in: International Parallel and Distributed Processing Symposium (IPDPS), Vancouver, Canada, IEEE, May 2018. [ DOI : 10.1109/IPDPS.2018.00075 ]
  https://hal.inria.fr/hal-01623846
• 11O. Beaumont, T. Lambert, L. Marchal, B. Thomas.
  Data-Locality Aware Dynamic Schedulers for Independent Tasks with Replicated Inputs, in: IPDPSW 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, Vancouver, Canada, IEEE, May 2018, pp. 1-8. [ DOI : 10.1109/IPDPSW.2018.00187 ]
  https://hal.inria.fr/hal-01878977
• 12L. Eyraud-Dubois, T. Lambert.
  Using Static Allocation Algorithms for Matrix Matrix Multiplication on Multicores and GPUs, in: ICPP 2018 - 47th International Conference on Parallel Processing, Eugene, OR, United States, August 2018. [ DOI : 10.1145/3225058.3225066 ]
  https://hal.inria.fr/hal-01670678
• 13A. A. Pessoa, M. Poss, R. Sadykov, F. Vanderbeck.
  Solving the robust CVRP under demand uncertainty, in: ODYSSEUS, Calgliari, Italy, June 2018.
  https://hal.inria.fr/hal-01703181
• 14A. A. Pessoa, R. Sadykov, E. Uchoa, F. Vanderbeck.
  Beyond Vehicle Routing: a general purpose branch-cut-and-price code for applications where pricing is a resource constrained shortest path (RCSP) Pricing, in: ISCO 2018 - 5th International Symposium on Combinatorial Optimization, Marrakesh, Morocco, April 2018.
  https://hal.inria.fr/hal-01958155

Conferences without Proceedings

• 15L. Pansart, H. Cambazard, N. Catusse, G. Stauffer.
  Kidney Exchange Problem: models and algorithms, in: ROADEF 2018 - 19ème congrès annuel de la société Française de Recherche Opérationnelle et d’Aide à la Décision, Lorient, France, February 2018.
  https://hal.archives-ouvertes.fr/hal-01798850
• 16S. Tanaka, B. Detienne, R. Sadykov.
  Time-indexed Formulations of the Truck-to-door Scheduling Problem at Multi-door Cross-docking Terminals with Temporary Storage, in: ISFA 2018 - International Symposium on Flexible Automation, Kanazawa, Japan, July 2018.
  https://hal.archives-ouvertes.fr/hal-01937146

Internal Reports

• 17G. Aupy, O. Beaumont, L. Eyraud-Dubois.
  Sizing and Partitioning Strategies for Burst-Buffers to Reduce IO Contention, Inria, October 2018, n^o RR-9213.
  https://hal.inria.fr/hal-01904032
• 18O. Beaumont, L. Eyraud-Dubois, Y. Gao.
  Influence of Tasks Duration Variability on Task-Based Runtime Schedulers, Inria, February 2018.
  https://hal.inria.fr/hal-01716489
• 19T. Bulhoes, R. Sadykov, A. Subramanian, E. Uchoa.
  On the exact solution of a large class of parallel machine scheduling problems, Universidade Federal Fluminense, October 2018, n^o Cadernos do LOGIS 2018-3.
  https://hal.inria.fr/hal-01958180
• 20A. A. Pessoa, M. Poss, R. Sadykov, F. Vanderbeck.
  Branch-and-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty, Universidade Federal Fluminense, September 2018, n^o Cadernos do LOGIS 2018-1.
  https://hal.inria.fr/hal-01958184

Other Publications

• 21F. Clautiaux, R. Sadykov, F. Vanderbeck, Q. Viaud.
  Pattern based diving heuristics for a two-dimensional guillotine cutting stock problem with leftovers, June 2018, Matheuristics 7th International workshop.
  https://hal.inria.fr/hal-01958165

References in notes

• 22K. 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/
• 23K. 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/
• 24M. 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, n^o 3, pp. 210-223. [ DOI : 10.1016/j.disopt.2013.06.001 ]
  http://hal.inria.fr/hal-00909480
• 25P. 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, n^o 6, pp. 487–502.
  http://hal.inria.fr/inria-00387012/en/
• 26P. 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/
• 27O. 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
• 28O. 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
• 29F. 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
• 30M. 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/
• 31B. 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/
• 32B. 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
• 33I. Diarrassouba, V. Gabrel, A. R. Mahjoub, L. Gouveia, P. Pesneau.
  Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem, in: Networks, March 2016, vol. 67, n^o 2. [ DOI : 10.1002/net.21667 ]
  https://hal.inria.fr/hal-01281958
• 34L. 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
• 35M. 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, n^o 11-2007.
• 36M. 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.
• 37R. 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
• 38R. 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
• 39R. 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
• 40Y. 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.
• 41Y. 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.
• 42L. 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.
• 43L. 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.
• 44J. 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
• 45Y. 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.
• 46D. 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, n^o 1, pp. 116-133.
• 47C. 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.
• 48C. 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/
• 49C. Joncour, A. Pêcher.
  Consecutive ones matrices for multi-dimensional orthogonal packing problems, in: Journal of Mathematical Modelling and Algorithms, 2012, vol. 11, n^o 1, pp. 23-44. [ DOI : 10.1007/s10852-011-9167-z ]
  http://hal.inria.fr/hal-00652574
• 50C. Joncour, A. Pêcher, P. Valicov.
  MPQ-trees for the orthogonal packing problem, in: Journal of Mathematical Modelling and Algorithms, March 2012, vol. 11, n^o 1, pp. 3-22. [ DOI : 10.1007/s10852-011-9159-z ]
  http://hal.archives-ouvertes.fr/hal-00611528
• 51P. Meurdesoif, P. Pesneau, F. Vanderbeck.
  Meter installation for monitoring network traffic, in: International Conference on Network Optimization, INOC, International Network Optimization Conference (INOC), 2007.
• 52P. 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.
• 53S. 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/
• 54S. Michel, F. Vanderbeck.
  A Column Generation based Tactical Planning Method for Inventory Routing, Inria, 2008.
  http://hal.inria.fr/inria-00169311/en/
• 55S. Michel, F. Vanderbeck.
  A Column Generation based Tactical Planning Method for Inventory Routing, in: Operations Research, 2012, vol. 60, n^o 2, pp. 382-397.
  http://hal.inria.fr/inria-00169311
• 56I. B. Mohamed, F. Vanderbeck, W. Klibi.
  Designing Stochastic Two-Echelon Distribution Networks, in: ROADEF, Metz, France, February 2017.
  https://hal.inria.fr/hal-01675701
• 57M. Mourgaya, F. Vanderbeck.
  Column generation based heuristic for tactical planning in multi period vehicle routing, in: European Journal of Operational Research, 2007, vol. 183, n^o 3, pp. 1028-1041.
• 58M. Padberg, G. Rinaldi.
  A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, in: SIAM Review, 1991, vol. 33, n^o 1, pp. 60–100.
• 59P. 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
• 60P. 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
• 61M. 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
• 62N. 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
• 63R. 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, n^o 3, pp. 1284–1304.
  http://dx.doi.org/10.1016/j.ejor.2006.06.078
• 64R. Sadykov.
  A polynomial algorithm for a simple scheduling problem at cross docking terminals, Inria, 2009, RR-7054.
  http://hal.inria.fr/inria-00412519/en/
• 65R. 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/
• 66R. Sadykov.
  Scheduling incoming and outgoing trucks at cross docking terminals to minimize the storage cost, in: Annals of Operations Research, 2012, vol. 201, n^o 1, pp. 423-440. [ DOI : 10.1007/s10479-012-1232-0 ]
  http://hal.inria.fr/inria-00539849
• 67R. Sadykov, F. Vanderbeck.
  Bin Packing with conflicts: a generic branch-and-price algorithm, in: INFORMS Journal on Computing, 2013, vol. 25, n^o 2, pp. 244-255. [ DOI : 10.1287/ijoc.1120.0499 ]
  http://hal.inria.fr/inria-00539869
• 68G. 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
• 69B. 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/
• 70B. 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/
• 71B. 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
• 72B. Vignac, F. Vanderbeck, B. Jaumard.
  Reformulation and Decomposition Approaches for Traffic Routing in Optical Networks, in: Networks, July 2016, vol. 67, n^o 4, pp. 277-298.
  https://hal.inria.fr/inria-00392256
• 73B. Vignac.
  Résolution d'un problème de groupage dans le réseaux optiques maillés, Université de Montréal, January 2010.