François Vanderbeck
Orcid: 0000-0001-5791-7053
According to our database1,
François Vanderbeck
authored at least 35 papers
between 1996 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Eur. J. Oper. Res., 2023
2022
Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem.
Eur. J. Oper. Res., 2022
2021
Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty.
Oper. Res., 2021
Design of robust programmable networks with bandwidth-optimal failure recovery scheme.
Comput. Networks, 2021
2020
Math. Program., 2020
Eur. J. Oper. Res., 2020
2019
INFORMS J. Comput., 2019
Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers.
EURO J. Comput. Optim., 2019
Poster: design of survivable SDN/NFV-enabled networks with bandwidth-optimal failure recovery.
Proceedings of the 2019 IFIP Networking Conference, 2019
Proceedings of the 2019 IEEE 8th International Conference on Cloud Networking, 2019
2018
Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation.
INFORMS J. Comput., 2018
Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem.
Discret. Optim., 2018
2016
Networks, 2016
Comput. Optim. Appl., 2016
2013
INFORMS J. Comput., 2013
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013
2012
Oper. Res., 2012
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012
2011
2010
Proceedings of the 50 Years of Integer Programming 1958-2008, 2010
2009
2008
2007
Column generation based heuristic for tactical planning in multi-period vehicle routing.
Eur. J. Oper. Res., 2007
2006
RAIRO Oper. Res., 2006
Oper. Res. Lett., 2006
2002
Math. Program., 2002
2001
A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem.
Manag. Sci., 2001
2000
Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem.
Oper. Res., 2000
On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm.
Oper. Res., 2000
1999
Computational study of a column generation algorithm for bin packing and cutting stock problems.
Math. Program., 1999
Oper. Res., 1999
1998
Oper. Res., 1998
1996