According to our database1, François Vanderbeck authored at least 28 papers between 1996 and 2020.
Legend:Book In proceedings Article PhD thesis Other
Designing a two-echelon distribution network under demand uncertainty.
European Journal of Operational Research, 2020
Primal Heuristics for Branch and Price: The Assets of Diving Methods.
INFORMS Journal on Computing, 2019
Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers.
EURO J. Computational Optimization, 2019
A Generic Exact Solver for Vehicle Routing and Related Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019
Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation.
INFORMS Journal on Computing, 2018
Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem.
Discrete Optimization, 2018
Reformulation and decomposition approaches for traffic routing in optical networks.
Column generation approaches for the software clustering problem.
Comp. Opt. and Appl., 2016
Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm.
INFORMS Journal on Computing, 2013
Column generation for extended formulations.
EURO J. Computational Optimization, 2013
In-Out Separation and Column Generation Stabilization by Dual Price Smoothing.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013
A Column-Generation Based Tactical Planning Method for Inventory Routing.
Operations Research, 2012
Feasibility Pump Heuristics for Column Generation Approaches.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012
Branching in branch-and-price: a generic scheme.
Math. Program., 2011
Column Generation for Extended Formulations.
Electronic Notes in Discrete Mathematics, 2011
Column Generation based Primal Heuristics.
Electronic Notes in Discrete Mathematics, 2010
Reformulation and Decomposition of Integer Programs.
Proceedings of the 50 Years of Integer Programming 1958-2008, 2010
Knapsack problems with setups.
European Journal of Operational Research, 2009
Comparison of bundle and classical column generation.
Math. Program., 2008
A generic view of Dantzig-Wolfe decomposition in mixed integer programming.
Oper. Res. Lett., 2006
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem.
Math. Program., 2002
A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem.
Management Science, 2001
Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem.
Operations Research, 2000
On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm.
Operations Research, 2000
Computational study of a column generation algorithm for bin packing and cutting stock problems.
Math. Program., 1999
A Tactical Planning Model for Mixed-Model Electronics Assembly Operations.
Operations Research, 1999
Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms.
Operations Research, 1998
An exact algorithm for IP column generation.
Oper. Res. Lett., 1996