An exact algorithm for IP column generation. - François Vanderbeck; Laurence A. Wolsey (Oper. Res. Lett., 1996)

Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms. - Alain S. Sutter; François Vanderbeck; Laurence A. Wolsey (Oper. Res., 1998)

A Tactical Planning Model for Mixed-Model Electronics Assembly Operations. - Anantaram Balakrishnan; François Vanderbeck (Oper. Res., 1999)

Computational study of a column generation algorithm for bin packing and cutting stock problems. - François Vanderbeck (Math. Program., 1999)

On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm. - François Vanderbeck (Oper. Res., 2000)

Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem. - François Vanderbeck (Oper. Res., 2000)

A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem. - François Vanderbeck (Manag. Sci., 2001)

Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem. - François Vanderbeck (Math. Program., 2002)

A generic view of Dantzig-Wolfe decomposition in mixed integer programming. - François Vanderbeck; Martin W. P. Savelsbergh (Oper. Res. Lett., 2006)

The periodic Vehicle routing problem: classification and heuristic. - M. Mourgaya; François Vanderbeck (RAIRO Oper. Res., 2006)

Column generation based heuristic for tactical planning in multi-period vehicle routing. - M. Mourgaya; François Vanderbeck (Eur. J. Oper. Res., 2007)

Comparison of bundle and classical column generation. - Olivier Briant; Claude Lemaréchal; Philippe Meurdesoif; S. Michel; Nancy Perrot; François Vanderbeck (Math. Program., 2008)

Knapsack problems with setups. - S. Michel; Nancy Perrot; François Vanderbeck (Eur. J. Oper. Res., 2009)

Reformulation and Decomposition of Integer Programs. - François Vanderbeck; Laurence A. Wolsey (50 Years of Integer Programming, 2010)

Column Generation based Primal Heuristics. - Cédric Joncour; Sophie Michel; Ruslan Sadykov; Dmitry Sverdlov; François Vanderbeck (Electron. Notes Discret. Math., 2010)

Branching in branch-and-price: a generic scheme. - François Vanderbeck (Math. Program., 2011)

Feasibility Pump Heuristics for Column Generation Approaches. - Pierre Pesneau; Ruslan Sadykov; François Vanderbeck (SEA, 2012)

A Column-Generation Based Tactical Planning Method for Inventory Routing. - S. Michel; François Vanderbeck (Oper. Res., 2012)

In-Out Separation and Column Generation Stabilization by Dual Price Smoothing. - Artur Alves Pessoa; Ruslan Sadykov; Eduardo Uchoa; François Vanderbeck (SEA, 2013)

Column generation for extended formulations. - Ruslan Sadykov; François Vanderbeck (EURO J. Comput. Optim., 2013)

Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm. - Ruslan Sadykov; François Vanderbeck (INFORMS J. Comput., 2013)

Column generation approaches for the software clustering problem. - Hugo Harry Kramer; Eduardo Uchoa; Marcia Fampa; Viviane Köhler; François Vanderbeck (Comput. Optim. Appl., 2016)

Reformulation and decomposition approaches for traffic routing in optical networks. - Benoit Vignac; François Vanderbeck; Brigitte Jaumard (Networks, 2016)

Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem. - François Clautiaux; Ruslan Sadykov; François Vanderbeck; Quentin Viaud (Discret. Optim., 2018)

Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation. - Artur Alves Pessoa; Ruslan Sadykov; Eduardo Uchoa; François Vanderbeck (INFORMS J. Comput., 2018)

Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks. - Andrea Tomassilli; Giuseppe Di Lena; Frédéric Giroire; Issam Tahiri; Damien Saucez; Stephane Perennes; Thierry Turletti; Ruslan Sadykov; François Vanderbeck; Chidung Lac (CloudNet, 2019)

Poster: design of survivable SDN/NFV-enabled networks with bandwidth-optimal failure recovery. - Andrea Tomassilli; Chidung Lac; Giuseppe Di Lena; Frédéric Giroire; Issam Tahiri; Damien Saucez; Stéphane Pérennes; Thierry Turletti; Ruslan Sadykov; François Vanderbeck (Networking, 2019)

Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers. - François Clautiaux; Ruslan Sadykov; François Vanderbeck; Quentin Viaud (EURO J. Comput. Optim., 2019)

Primal Heuristics for Branch and Price: The Assets of Diving Methods. - Ruslan Sadykov; François Vanderbeck; Artur Alves Pessoa; Issam Tahiri; Eduardo Uchoa (INFORMS J. Comput., 2019)

Designing a two-echelon distribution network under demand uncertainty. - Imen Ben Mohamed; Walid Klibi; François Vanderbeck (Eur. J. Oper. Res., 2020)

A generic exact solver for vehicle routing and related problems. - Artur Alves Pessoa; Ruslan Sadykov; Eduardo Uchoa; François Vanderbeck (Math. Program., 2020)

Design of robust programmable networks with bandwidth-optimal failure recovery scheme. - Andrea Tomassilli; Giuseppe Di Lena; Frédéric Giroire; Issam Tahiri; Damien Saucez; Stéphane Pérennes; Thierry Turletti; Ruslan Sadykov; François Vanderbeck; Chidung Lac (Comput. Networks, 2021)

Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty. - Artur Alves Pessoa; Michael Poss; Ruslan Sadykov; François Vanderbeck (Oper. Res., 2021)

Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem. - Rodolphe Griset; Pascale Bendotti; Boris Detienne; Marc Porcheron; Halil Sen; François Vanderbeck (Eur. J. Oper. Res., 2022)

The two-echelon stochastic multi-period capacitated location-routing problem. - Imen Ben Mohamed; Walid Klibi; Ruslan Sadykov; Halil Sen; François Vanderbeck (Eur. J. Oper. Res., 2023)