François Vanderbeck

According to our database1, François Vanderbeck authored at least 33 papers between 1996 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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
A generic exact solver for vehicle routing and related problems.
Math. Program., 2020

Designing a two-echelon distribution network under demand uncertainty.
Eur. J. Oper. Res., 2020

2019
Primal Heuristics for Branch and Price: The Assets of Diving Methods.
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

Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks.
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
Reformulation and decomposition approaches for traffic routing in optical networks.
Networks, 2016

Column generation approaches for the software clustering problem.
Comput. Optim. Appl., 2016

2013
Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm.
INFORMS J. Comput., 2013

In-Out Separation and Column Generation Stabilization by Dual Price Smoothing.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

2012
A Column-Generation Based Tactical Planning Method for Inventory Routing.
Oper. Res., 2012

Feasibility Pump Heuristics for Column Generation Approaches.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

2011
Branching in branch-and-price: a generic scheme.
Math. Program., 2011

Column Generation for Extended Formulations.
Electron. Notes Discret. Math., 2011

2010
Column Generation based Primal Heuristics.
Electron. Notes Discret. Math., 2010

Reformulation and Decomposition of Integer Programs.
Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2009
Knapsack problems with setups.
Eur. J. Oper. Res., 2009

2008
Comparison of bundle and classical column generation.
Math. Program., 2008

2007
Column generation based heuristic for tactical planning in multi-period vehicle routing.
Eur. J. Oper. Res., 2007

2006
The periodic Vehicle routing problem: classification and heuristic.
RAIRO Oper. Res., 2006

A generic view of Dantzig-Wolfe decomposition in mixed integer programming.
Oper. Res. Lett., 2006

2002
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem.
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

A Tactical Planning Model for Mixed-Model Electronics Assembly Operations.
Oper. Res., 1999

1998
Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms.
Oper. Res., 1998

1996
An exact algorithm for IP column generation.
Oper. Res. Lett., 1996


  Loading...