Project-Team Realopt
Personnel
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

previous Previous | up Home

Bibliography

Major publications by the team in recent years
  • 1C. Alves, F. Clautiaux, J. M. Valério De Carvalho, J. Rietz.
    Dual-Feasible Functions for Integer Programming and Combinatorial Optimization, Springer, January 2016.
    https://hal.inria.fr/hal-01410180
  • 2C. Bachoc, A. Pêcher, A. Thiéry.
    On the theta number of powers of cycle graphs, in: Combinatorica, Jun 2013, vol. 33, no 3, pp. 297–317.
    https://doi.org/10.1007/s00493-013-2950-x
  • 3F. Clautiaux, S. Hanafi, R. Macedo, E. Voge, C. Alves.
    Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints, in: European Journal of Operational Research, 2017, vol. 258, pp. 467 - 477. [ DOI : 10.1016/j.ejor.2016.09.051 ]
    https://hal.inria.fr/hal-01410170
  • 4B. Detienne, R. Sadykov, S. Tanaka.
    The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation, in: European Journal of Operational Research, 2016, vol. 252, no 3, pp. 750 - 760.
  • 5A. Pêcher, A. K. Wagler.
    Computing clique and chromatic number of circular-perfect graphs in polynomial time, in: Mathematical Programming, Oct 2013, vol. 141, no 1, pp. 121–133.
    https://doi.org/10.1007/s10107-012-0512-4
  • 6R. 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.
  • 7R. Sadykov, F. Vanderbeck.
    Column Generation for Extended Formulations, in: EURO Journal on Computational Optimization, May 2013, vol. 1, no 1-2, pp. 81-115. [ DOI : 10.1007/s13675-013-0009-9 ]
    https://hal.inria.fr/hal-00661758
  • 8F. Vanderbeck.
    Branching in Branch-and-Price: a Generic Scheme, in: Mathematical Programming, Series A, 2011, vol. 130, pp. 249-294. [ DOI : 10.1007/s10107-009-0334-1 ]
    http://hal.inria.fr/inria-00311274
  • 9F. Vanderbeck, L. Wolsey.
    Reformulation and Decomposition of Integer Programs, in: 50 Years of Integer Programming 1958-2008, Springer, 2010, CORE DP 2009/16. [ DOI : 10.1007/978-3-540-68279-0_13 ]
    http://hal.inria.fr/inria-00392254
Publications of the year

Doctoral Dissertations and Habilitation Theses

Articles in International Peer-Reviewed Journals

  • 12T. Bellitto.
    Separating codes and traffic monitoring, in: Theoretical Computer Science, 2017. [ DOI : 10.1016/j.tcs.2017.03.044 ]
    https://hal.archives-ouvertes.fr/hal-01514034
  • 13F. Clautiaux, S. Hanafi, R. Macedo, E. Voge, C. Alves.
    Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints, in: European Journal of Operational Research, 2017, vol. 258, pp. 467 - 477. [ DOI : 10.1016/j.ejor.2016.09.051 ]
    https://hal.inria.fr/hal-01410170
  • 14L. Gouveia, P. Pesneau, M. Ruthmair, D. Santos.
    Combining and projecting flow models for the (Precedence Constrained) Asymmetric Traveling Salesman Problem, in: Networks, 2017, pp. 1-19, forthcoming. [ DOI : 10.1002/net.21765 ]
    https://hal.inria.fr/hal-01655793
  • 15A. Pessoa, R. Sadykov, E. Uchoa, F. Vanderbeck.
    Automation and combination of linear-programming based stabilization techniques in column generation, in: INFORMS Journal on Computing, July 2017, forthcoming.
    https://hal.inria.fr/hal-01077984
  • 16D. C. Porumbel, F. Clautiaux.
    Convergent Dual Bounds Using an Aggregation of Set-Covering Constraints for Capacitated Problems, in: INFORMS Journal on Computing, 2017, vol. 29, no 1, 15 p.
    https://hal.inria.fr/hal-01410195
  • 17R. Sadykov, F. Vanderbeck, 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

Invited Conferences

International Conferences with Proceedings

  • 20O. 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, in: IEEE International Parallel & Distributed Processing Symposium (IPDPS), Orlando, United States, May 2017.
    https://hal.inria.fr/hal-01386174
  • 21T. Bulhoes, R. Sadykov, E. Uchoa, A. Subramanian.
    On the exact solution of a large class of parallel machine scheduling problems, in: Proceedings of the 8th Multidisciplinary International Conference on Scheduling : Theory and Applications, Kuala-Lumpur, Malaysia, December 2017, pp. 325-328.
    https://hal.inria.fr/hal-01664822
  • 22I. B. Mohamed, F. Vanderbeck, W. Klibi.
    Designing Stochastic Two-Echelon Distribution Networks, in: ROADEF, Metz, France, February 2017.
    https://hal.inria.fr/hal-01675701

National Conferences with Proceedings

  • 23A. A. Pessoa, R. Sadykov, E. Uchoa.
    Improved Branch-Cut-and-Price algorithm for the Heterogeneous Vehicle Routing Problem, in: 18ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Metz, France, February 2017.
    https://hal.inria.fr/hal-01676020

Conferences without Proceedings

  • 24F. Clautiaux, B. Detienne, G. Guillot.
    Dynamic programming based methods for solving a temporal knapsack problem, in: IFORS 2017, 21st Conference of the International Federation of Operational Research Societies, Québec, Canada, July 2017.
    https://hal.inria.fr/hal-01678214
  • 25L. Gouveia, P. Pesneau, M. Ruthmair, D. Santos.
    Extending and Projecting Flow Models for the (PC)ATSP, in: Optimization 2017, Lisbon, Portugal, September 2017.
    https://hal.inria.fr/hal-01667084
  • 26R. 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
  • 27R. 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
  • 28R. 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
  • 29G. Guillot, F. Clautiaux, B. Detienne.
    Une méthode basée sur la programmation dynamique pour résoudre le problème de sac à dos temporel, in: Dixièmes Journées Polyèdres et Optimisation Combinatoire JPOC10, Paris, France, June 2017.
    https://hal.inria.fr/hal-01670226
  • 30A. A. Pessoa, R. Sadykov, E. Uchoa.
    An improved Branch-Cut-and-Price algorithm for heterogeneous vehicle routing problems, in: VeRoLog 2017 - Annual Workshop of the EURO Working Group on Vehicle Routing and Logistics optimization, Amsterdam, Netherlands, July 2017.
    https://hal.inria.fr/hal-01676022
  • 31R. Sadykov, A. Alves Pessoa, E. Uchoa.
    A branch-cut-and-price algorithm for the distance constrained multi-depot vehicle routing problem, in: 21st Conference of the International Federation of Operational Research Societies, Quebec, Canada, July 2017.
    https://hal.inria.fr/hal-01676023
  • 32Q. Viaud, F. Clautiaux, R. Sadykov.
    Heuristiques pour des problèmes de découpe guillotine par batchs, in: ROADEF 2017, Metz, France, February 2017.
    https://hal.archives-ouvertes.fr/hal-01678367

Internal Reports

  • 33A. Alves Pessoa, R. Sadykov, E. Uchoa.
    Enhanced Branch-Cut-and-Price Algorithm for Heterogeneous Fleet Vehicle Routing Problems, Universidade Federal Fluminense, April 2017, no Cadernos do LOGIS 2017/3.
    https://hal.inria.fr/hal-01664844
  • 34O. Beaumont, T. Lambert, L. Marchal, B. Thomas.
    Matching-Based Assignement Strategies for Improving Data Locality of Map Tasks in MapReduce, Inria - Research Centre Grenoble – Rhône-Alpes ; Inria Bordeaux Sud-Ouest, February 2017, no RR-8968.
    https://hal.inria.fr/hal-01386539
  • 35F. 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
  • 36R. Sadykov, T. Bulhoes, E. Uchoa.
    A branch-and-price algorithm for the Minimum Latency Problem, Universidade Federal Fluminense, July 2017, no Cadernos do LOGIS 2017/4.
    https://hal.inria.fr/hal-01664835
  • 37R. Sadykov, E. Uchoa, A. Alves Pessoa.
    A Bucket Graph Based Labeling Algorithm with Application to Vehicle Routing, Universidade Federal Fluminense, October 2017, no Cadernos do LOGIS 2017/7.
    https://hal.inria.fr/hal-01664854

Other Publications

References in notes
  • 42K. 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/
  • 43K. 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/
  • 44M. 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
  • 45P. 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/
  • 46P. 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/
  • 47O. Beaumont, I. Belaid, L. Eyraud-Dubois, J.-A. Lorenzo-Del-Castillo.
    Allocating jobs with periodic demand variations, in: Euro-Par 2015, Vienna, Austria, Träff, Jesper Larsson, Hunold, Sascha, Versaci, Francesco, 2015. [ DOI : 10.1007/978-3-662-48096-0_12 ]
    https://hal.inria.fr/hal-01118176
  • 48O. Beaumont, L. Eyraud-Dubois, J.-A. Lorenzo, P. Renaud-Goud.
    Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints, in: IEEE International Conference on High Performance Computing (HiPC 2014), Goa, India, Proceedings of the IEEE International Conference on High Performance Computing (HiPC 2014), IEEE, December 2014, 12 p.
    https://hal.inria.fr/hal-00874936
  • 49M. 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/
  • 50G. Dahl, D. Huygens, A. R. Mahjoub, P. Pesneau.
    On the k-edge disjoint 2-hop-constrained paths polytope, in: Operations Research Letters, 2005, vol. 34, pp. 577–582.
  • 51B. 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/
  • 52B. 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
  • 53B. Fortz, A. R. Mahjoub, S. T. McCormick, P. Pesneau.
    Two-edge connected subgraphs with bounded rings: polyhedral results and branch-and-cut, in: Mathematical Programming, 2006, vol. 105, no 1, pp. 85–111.
  • 54M. 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.
  • 55M. 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.
  • 56Y. 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.
  • 57Y. 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.
  • 58L. 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.
  • 59L. 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.
  • 60J. 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
  • 61Y. 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.
  • 62D. 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.
  • 63D. Huygens, A. R. Mahjoub, P. Pesneau.
    Two edge-disjoint hop-constrained paths and polyhedra, in: SIAM Journal of Discrete Mathematics, 2004, vol. 18, no 2, pp. 287–312.
  • 64C. 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.
  • 65C. 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/
  • 66C. 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
  • 67C. 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
  • 68P. Meurdesoif, P. Pesneau, F. Vanderbeck.
    Meter installation for monitoring network traffic, in: International Conference on Network Optimization, INOC, International Network Optimization Conference (INOC), 2007.
  • 69P. 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.
  • 70S. Michel.
    Optimisation des tournées de véhicules combinées à la gestion de stock, Université Bordeaux 1, Dec 2006.
  • 71S. 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/
  • 72S. Michel, F. Vanderbeck.
    A Column Generation based Tactical Planning Method for Inventory Routing, Inria, 2008.
    http://hal.inria.fr/inria-00169311/en/
  • 73S. 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
  • 74M. Mourgaya, F. Vanderbeck.
    The Periodic Vehicle Routing Problem: classification and heuristic, in: RAIRO-OR, April-June 2006, vol. 40, no 2, pp. 169–194.
  • 75M. 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.
  • 76M. 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.
  • 77N. Perrot.
    Advanced IP column generation strategies for the cutting stock stock problem and its variants, University Bordeaux 1, 2005.
  • 78N. Perrot, F. Vanderbeck.
    Industrial Cutting Stock Problem, in: Collection Sciences, Technologie Informatique, Presses Universitaires de Valenciennes, 2006.
  • 79M. 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
  • 80A. Pêcher, A. Wagler.
    Almost all webs are not rank-perfect, in: Mathematical Programming, 2006, vol. 105, pp. 311–328.
  • 81R. 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
  • 82R. Sadykov.
    A polynomial algorithm for a simple scheduling problem at cross docking terminals, Inria, 2009, RR-7054.
    http://hal.inria.fr/inria-00412519/en/
  • 83R. 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/
  • 84R. 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
  • 85R. 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
  • 86R. Sadykov, L. A. Wolsey.
    Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates, in: INFORMS Journal on Computing, 1 2006, vol. 18, no 2, pp. 209–217.
  • 87G. 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
  • 88A. Sutter, F. Vanderbeck, L. A. Wolsey.
    Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms, in: Operations Research, 1998, vol. 46, no 5, pp. 719–728.
  • 89F. Vanderbeck.
    Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem, in: Operations Research, 2000, vol. 48, no 5, pp. 915–926.
  • 90F. Vanderbeck.
    A nested decomposition approach to a 3-stage 2-dimensional cutting stock problem, in: Management Science, 2001, vol. 47, no 2, pp. 864–879.
  • 91F. Vanderbeck.
    Extending Dantzig's Bound to the Bounded Multiple-class Knapsack Problem, in: Mathematical Programming, Ser. A, 2002, vol. 94, no 1, pp. 125–136.
  • 92F. Vanderbeck.
    Lot-sizing with start-up times, in: Management Science, 1998, vol. 44, no 10, pp. 1409–1425.
  • 93F. Vanderbeck.
    Computational study of a column generation algorithm for bin packing and cutting stock problems, in: Mathematical Programming, Ser. A, 1999, vol. 86, pp. 565–594.
  • 94B. 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/
  • 95B. 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/
  • 96B. 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
  • 97B. Vignac.
    Résolution d'un problème de groupage dans le réseaux optiques maillés, Université de Montréal, January 2010.
  • 98H. Şen, B. Detienne, R. Sadykov, F. Vanderbeck.
    A review of algorithmic enhancements for Benders decomposition, in: 4th International Symposium on Combinatorial Optimization (ISCO 2016), Vietri-sul-mare, Italy, May 2016.
    https://hal.inria.fr/hal-01427944

previous Previous | up Home