Bibliography

Major publications by the team in recent years

• 1O. Briant, C. Lemaréchal, P. Meurdesoif, S. Michel, N. Perrot, F. Vanderbeck.
  Comparison of Bundle and Classical Column Generation, in: Mathematical Programming, 2008, vol. 113, n^o 2, pp. 299–344.
• 2S. Coulonges, A. Pêcher, A. Wagler.
  Characterizing and bounding the imperfection ratio for some classes of graphs, in: Mathematical Programming, Series A, 2009, vol. 118, n^o 1, pp. 37-46.
  http://hal.archives-ouvertes.fr/hal-00308150/en/
• 3L. Gouveia, P. Pesneau.
  On extended formulations for the precedence constrained asymmetric traveling salesman problem, in: Networks, 2006, vol. 48, n^o 6, pp. 77–89.
• 4A. Pêcher, A. Wagler.
  Almost all webs are not rank-perfect, in: Mathematical Programming, 2006, vol. 105, n^o 2-3, pp. 311–328.
• 5R. 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, n^o 2, pp. 209–217.
• 6F. Vanderbeck.
  On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm, in: Operations Research, 2000, vol. 48, n^o 1, pp. 111–128.
• 7F. 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
• 8F. 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.
• 9F. Vanderbeck, L. Wolsey.
  Reformulation and Decomposition of Integer Programs, in: 50 Years of Integer Programming 1958-2008, Springer, 2010, CORE DP 2009/16 CORE DP 2009/16. [ DOI : 10.1007/978-3-540-68279-0_13 ]
  http://hal.inria.fr/inria-00392254

Publications of the year

Articles in International Peer-Reviewed Journals

• 10M. 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
• 11C. Alves, J. M. Valério de Carvalho, F. Clautiaux, J. Rietz.
  Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem, in: European Journal of Operational Research, 2014, vol. 233, n^o 1, pp. 43-63.
  http://hal.inria.fr/hal-00909508
• 12F. Clautiaux, A. Jouglet, A. Moukrim.
  A new graph-theoretical model for k-dimensional guillotine-cutting problems, in: INFORMS Journal on Computing, 2013, vol. 25, n^o 1, pp. 72-86. [ DOI : 10.1287/ijoc.1110.0478 ]
  http://hal.inria.fr/hal-00943849
• 13B. Detienne.
  A Mixed Integer Linear Programming approach to minimize the number of late jobs with and without machine availability constraints, in: European Journal of Operational Research, October 2013. [ DOI : 10.1016/j.ejor.2013.10.052 ]
  http://hal.inria.fr/hal-00880908
• 14M. T. Godinho, L. Gouveia, P. Pesneau.
  Natural and Extended formulations for the Time-Dependent Traveling Salesman Problem, in: Discrete Applied Mathematics, 2014, vol. 164, pp. 138-153. [ DOI : 10.1016/j.dam.2011.11.019 ]
  http://hal.inria.fr/hal-00648451
• 15J. Han, K. Lee, C. Lee, S. Park.
  Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees, in: INFORMS Journal on Computing, August 2013, vol. 25, n^o 3, pp. 585-596. [ DOI : 10.1287/ijoc.1120.0523 ]
  http://hal.inria.fr/hal-00857862
• 16J. Han, C. Lee, S. Park.
  A Robust Scenario Approach for the Vehicle Routing Problem with Uncertain Travel Times, in: Transportation Science, August 2013. [ DOI : 10.1287/trsc.2013.0476 ]
  http://hal.inria.fr/hal-00857871
• 17A. Pêcher, C. Bachoc, A. Thiery.
  On the Theta number of powers of cycle graphs, in: Combinatorica, 2014, to appear.
  http://hal.inria.fr/hal-00920927
• 18A. Pêcher, G. J. Chang, M. Montassier, A. Raspaud.
  Strong chromatic index of planar graphs with large girth, in: Discussiones Mathematicae Graph Theory, 2014, to appear.
  http://hal.inria.fr/hal-00920932
• 19A. Pêcher, A. Wagler.
  Computing clique and chromatic number of circular-perfect graphs in polynomial time, in: Mathematical Programming A, 2013, vol. 141, pp. 121-133.
  http://hal.inria.fr/hal-00760621
• 20A. Pêcher, A. Wagler.
  Computing the clique number of a-perfect graphs in polynomial time, in: European Journal of Combinatorics, 2014, vol. 35, pp. 449-458.
  http://hal.inria.fr/hal-00920846
• 21R. 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
• 22R. Sadykov, F. Vanderbeck.
  Column Generation for Extended Formulations, in: EURO Journal on Computational Optimization, May 2013, vol. 1, n^o 1-2, pp. 81-115. [ DOI : 10.1007/s13675-013-0009-9 ]
  http://hal.inria.fr/hal-00661758

Invited Conferences

• 23A. Pêcher.
  Interval graphs for orthogonal packing problems, in: International Conference in Discrete Mathematics, Dharwad, India, June 2013.
  http://hal.inria.fr/hal-00920835
• 24F. Vanderbeck.
  Extended formulations, Column Generation, and stabilization: synergies in the benefit of large scale applications, in: EURO INFORMS 26, Rome, Italy, July 2013.
  http://hal.inria.fr/hal-00845318

International Conferences with Proceedings

• 25O. Beaumont, L. Eyraud-Dubois, P. Pesneau, P. Renaud-Goud.
  Reliable Service Allocation in Clouds with Memory and Capacity Constraints, in: Resilience 2013, in conjunction with EuroPar 2013, Aachen, Germany, September 2013.
  http://hal.inria.fr/hal-00850125
• 26J. Han, R. Sadykov, F. Vanderbeck.
  Parallel Machine Scheduling with Generalized Precedence Relations, in: Multidisciplinary International Scheduling Conference: Theory & Applications, Gent, Belgium, August 2013.
  http://hal.inria.fr/hal-00857856
• 27A. Pessoa, R. Sadykov, E. Uchoa, F. Vanderbeck.
  In-Out Separation and Column Generation Stabilization by Dual Price Smoothing, in: 12th International Symposium on Experimental Algorithms, Rome, Italy, V. Bonifaci, C. Demetrescu, A. Marchetti-Spaccamela (editors), June 2013, Sringer, June 2013, vol. LNCS 7933, pp. 354-365. [ DOI : 10.1007/978-3-642-38527-8 ]
  http://hal.inria.fr/hal-00750412
• 28A. Pêcher, M. Montassier, A. Raspaud.
  Strong chromatic index of planar graphs with large girth, in: Eurocomb'13-European Conference on Combinatorics, Graph Theory and Applications, Pisa, Italy, September 2013, to appear.
  http://hal.inria.fr/hal-00920842
• 29R. Sadykov, A. Lazarev, V. Shiryaev, A. Stratonnikov.
  Solving a Freight Railcar Flow Problem Arising in Russia, in: ATMOS - 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems - 2013, Sophia Antipolis, France, Dagstuhl Open Access Series in Informatics, 2013. [ DOI : 10.4230/OASIcs.ATMOS.2013.55 ]
  http://hal.inria.fr/hal-00857914

Conferences without Proceedings

• 30S. Borne, P. Fouilhoux, R. Grappe, M. Lacroix, P. Pesneau.
  Circuit and bond polytopes in series-parallel graphs, in: JPOC8 - 8èmes Journées Polyèdres et Optimisation Combinatoire, Clermont-Ferrand, France, 2013.
  http://hal.inria.fr/hal-00909472
• 31S. Borne, P. Fouilhoux, R. Grappe, M. Lacroix, P. Pesneau.
  Branch-and-Cut algorithm for the connected-cut problem, 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, February 2014.
  http://hal.inria.fr/hal-00946285
• 32M. Bué, F. Clautiaux, L. Brotcorne.
  Conception d'un système de rangement à deux niveaux, 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, February 2014.
  http://hal.inria.fr/hal-00946388
• 33M. GERARD, F. Clautiaux.
  planification hebdomadaire sur plusieurs sites d'un personnel hétérogène et poly-compétent sous contraintes multiples, 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, February 2014.
  http://hal.inria.fr/hal-00946320
• 34J. 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, February 2014.
  http://hal.inria.fr/hal-00946294
• 35H. H. Kramer, M. Fampa, V. Köhler, E. Uchoa, F. Vanderbeck.
  Staged Column Generation Approach for the Software Clustering Problem, 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, February 2014.
  http://hal.inria.fr/hal-00946286
• 36A. Linhares, R. Sadykov, F. Vanderbeck, L. Di Puglia Pugliese, F. Guerriero.
  Dynamic programming algorithms for the (Elementary) Resource Constrained Shortest Path Problem, in: 26th European Conference on Operational Research, Rome, Italy, 2013.
  http://hal.inria.fr/hal-00857928
• 37A. Parreau, F. Clautiaux.
  Coloration bornée avec multiplicité, 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, February 2014.
  http://hal.inria.fr/hal-00946329
• 38M. Poggi De Aragão, F. Castilla, R. Sadykov, F. Vanderbeck.
  The Vehicle Routing Problem with Time Windows, Limited Number of Vehicles and Exact Operation Synchronization (m-VRPTWEOS), in: 26th European Conference on Operational Research, Rome, Italy, 2013.
  http://hal.inria.fr/hal-00857924
• 39R. Sadykov, A. Lazarev, V. Shiryaev, A. Stratonnikov.
  Freight railcar routing problem in Russia, in: 26th European Conference on Operational Research, Rome, Italy, 2013.
  http://hal.inria.fr/hal-00857920
• 40F. Vanderbeck, A. Pessoa, R. Sadykov, E. Uchoa.
  Stabilization techniques for Column Generation: towards automated schemes, in: EURO INFORMS 26, Rome, Italy, July 2013.
  http://hal.inria.fr/hal-00845858

Scientific Books (or Scientific Book chapters)

• 41P. Belotti, S. Cafieri, J. Lee, L. Liberti, A. J. Miller.
  On the composition of convex envelopes for quadrilinear terms, in: Optimization, Simulation, and Control, Springer Optimization and Its Applications, Springer Verlag, 2013, pp. 1-16. [ DOI : 10.1007/978-1-4614-5131-0_1 ]
  http://hal.inria.fr/hal-00769671
• 42A. Pêcher, A. Wagler.
  Beyond Perfection: Computational Results for Superclasses, in: Facets of Combinatorial Optimization - Festschrift for Martin Grötschel, M. Jünger, G. Reinelt (editors), Springer, September 2013, pp. 133-161.
  http://hal.inria.fr/hal-00920940

Other Publications

• 43D. C. Porumbel, F. Clautiaux.
  Convergent Dual Bounds Using an Aggregation of Set-Covering Constraints for Capacitated Problems, 2013.
  http://hal.inria.fr/hal-00747375

References in notes

• 44K. 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/
• 45K. 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/
• 46P. 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/
• 47P. 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/
• 48M. 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/
• 49G. 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.
• 50B. 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/
• 51B. 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, n^o 1, pp. 85–111.
• 52M. 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.
• 53M. 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.
• 54Y. 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.
• 55Y. 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.
• 56L. 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.
• 57L. 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.
• 58J. Han, P. Bendotti, B. Detienne, G. Petrou, M. Porcheron, R. Sadykov, F. Vanderbeck.
  Extended Formulation for Maintenance Planning at Power Plants, in: ROADEF 2014. Conférence Française de Recherche Opérationnelle et d'Aide à la Décision, 2014.
• 59J. Han, P. Pesneau, A. Pessoa, E. Uchoa, F. Vanderbeck.
  Column Generation Stabilization using Dual Smoothing: Theory & Practice, in: Column Generation 2012, Bromont, Canada, June 2012.
  http://hal.inria.fr/hal-00750573
• 60Y. 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.
• 61D. 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.
• 62D. Huygens, A. R. Mahjoub, P. Pesneau.
  Two edge-disjoint hop-constrained paths and polyhedra, in: SIAM Journal of Discrete Mathematics, 2004, vol. 18, n^o 2, pp. 287–312.
• 63C. 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.
• 64C. Joncour, S. Michel, R. Sadykov, D. Sverdlov, F. Vanderbeck.
  Column Generation based Primal Heuristics, in: Submitted to ISCO 2010, 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, n^o 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, n^o 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, n^o 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, n^o 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, n^o 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, n^o 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 (editor), ROADEF 2006, 2006.
• 79P. Pesneau, R. Sadykov, F. Vanderbeck.
  Feasibility Pump Heuristics for Column Generation Approaches, in: 11th International Symposium on Experimental Algorithms, Bordeaux, France, LNCS series, Springer, June 2012.
  http://hal.inria.fr/hal-00686255
• 80M. 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
• 81A. Pêcher, A. Wagler.
  Almost all webs are not rank-perfect, in: Mathematical Programming, 2006, vol. 105, pp. 311–328.
• 82R. 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
• 83R. Sadykov.
  A polynomial algorithm for a simple scheduling problem at cross docking terminals, Inria, 2009, RR-7054.
  http://hal.inria.fr/inria-00412519/en/
• 84R. 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/
• 85R. 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
• 86G. 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
• 87A. Sutter, F. Vanderbeck, L. A. Wolsey.
  Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms, in: Operations Research, 1998, vol. 46, n^o 5, pp. 719–728.
• 88F. Vanderbeck, J. Han, P. Pesneau, A. Pessoa, R. Sadykov, E. Uchoa.
  Column Generation Stabilization using Dual Smoothing: Theory and Practice, in: Informs Annual Meeting: Informatics Rising, Phoenix, États-Unis, October 2012.
  http://hal.inria.fr/hal-00750576
• 89F. Vanderbeck, J. Han, P. Pesneau, A. Pessoa, R. Sadykov, E. Uchoa.
  Unifying procedures for Cut-Column Generation and Stabilization, in: Workshop on Integer Programming, Valparaiso, Chili, March 2012.
  http://hal.inria.fr/hal-00750579
• 90F. Vanderbeck, C. Joncour, S. Michel, P. Pesneau, A. Pessoa, M. Poggi, R. Sadykov, E. Uchoa.
  Primal heuristics for branch-and-price, in: 21th International Symposium on Mathematical Programming (ISMP 2012), Berlin, Allemagne, August 2012.
  http://hal.inria.fr/hal-00750578
• 91F. Vanderbeck.
  Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem, in: Operations Research, 2000, vol. 48, n^o 5, pp. 915–926.
• 92F. Vanderbeck.
  A nested decomposition approach to a 3-stage 2-dimensional cutting stock problem, in: Management Science, 2001, vol. 47, n^o 2, pp. 864–879.
• 93F. Vanderbeck.
  Extending Dantzig's Bound to the Bounded Multiple-class Knapsack Problem, in: Mathematical Programming, Ser. A, 2002, vol. 94, n^o 1, pp. 125–136.
• 94F. Vanderbeck.
  Lot-sizing with start-up times, in: Management Science, 1998, vol. 44, n^o 10, pp. 1409–1425.
• 95F. 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.
• 96B. 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/
• 97B. 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/
• 98B. 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, http://hal.inria.fr/inria-00392256/en/
• 99B. Vignac.
  Résolution d'un problème de groupage dans le réseaux optiques maillés, Université de Montréal, January 2010.