default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançois Vanderbeck
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j31]Imen Ben Mohamed
, Walid Klibi, Ruslan Sadykov, Halil Sen, François Vanderbeck:
The two-echelon stochastic multi-period capacitated location-routing problem. Eur. J. Oper. Res. 306(2): 645-667 (2023)- 2022
- [j30]Rodolphe Griset, Pascale Bendotti, Boris Detienne, Marc Porcheron, Halil Sen, François Vanderbeck:
Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem. Eur. J. Oper. Res. 298(3): 1067-1083 (2022) - 2021
- [j29]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:
Design of robust programmable networks with bandwidth-optimal failure recovery scheme. Comput. Networks 192: 108043 (2021) - [j28]Artur Alves Pessoa, Michael Poss, Ruslan Sadykov, François Vanderbeck:
Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty. Oper. Res. 69(3): 739-754 (2021) - 2020
- [j27]Imen Ben Mohamed, Walid Klibi, François Vanderbeck:
Designing a two-echelon distribution network under demand uncertainty. Eur. J. Oper. Res. 280(1): 102-123 (2020) - [j26]Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck:
A generic exact solver for vehicle routing and related problems. Math. Program. 183(1): 483-523 (2020)
2010 – 2019
- 2019
- [j25]François Clautiaux, Ruslan Sadykov, François Vanderbeck, Quentin Viaud:
Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers. EURO J. Comput. Optim. 7(3): 265-297 (2019) - [j24]Ruslan Sadykov, François Vanderbeck, Artur Alves Pessoa, Issam Tahiri, Eduardo Uchoa:
Primal Heuristics for Branch and Price: The Assets of Diving Methods. INFORMS J. Comput. 31(2): 251-267 (2019) - [c5]Andrea Tomassilli, Giuseppe Di Lena, Frédéric Giroire, Issam Tahiri, Damien Saucez, Stephane Perennes, Thierry Turletti, Ruslan Sadykov, François Vanderbeck, Chidung Lac:
Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks. CloudNet 2019: 1-6 - [c4]Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck:
A Generic Exact Solver for Vehicle Routing and Related Problems. IPCO 2019: 354-369 - [c3]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:
Poster: design of survivable SDN/NFV-enabled networks with bandwidth-optimal failure recovery. Networking 2019: 1-2 - 2018
- [j23]François Clautiaux, Ruslan Sadykov, François Vanderbeck, Quentin Viaud:
Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem. Discret. Optim. 29: 18-44 (2018) - [j22]Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck:
Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation. INFORMS J. Comput. 30(2): 339-360 (2018) - 2016
- [j21]Hugo Harry Kramer, Eduardo Uchoa, Marcia Fampa, Viviane Köhler, François Vanderbeck:
Column generation approaches for the software clustering problem. Comput. Optim. Appl. 64(3): 843-864 (2016) - [j20]Benoit Vignac, François Vanderbeck, Brigitte Jaumard:
Reformulation and decomposition approaches for traffic routing in optical networks. Networks 67(4): 277-298 (2016) - 2013
- [j19]Ruslan Sadykov, François Vanderbeck:
Column generation for extended formulations. EURO J. Comput. Optim. 1(1-2): 81-115 (2013) - [j18]Ruslan Sadykov, François Vanderbeck:
Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm. INFORMS J. Comput. 25(2): 244-255 (2013) - [c2]Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck:
In-Out Separation and Column Generation Stabilization by Dual Price Smoothing. SEA 2013: 354-365 - 2012
- [j17]S. Michel, François Vanderbeck:
A Column-Generation Based Tactical Planning Method for Inventory Routing. Oper. Res. 60(2): 382-397 (2012) - [c1]Pierre Pesneau, Ruslan Sadykov, François Vanderbeck:
Feasibility Pump Heuristics for Column Generation Approaches. SEA 2012: 332-343 - 2011
- [j16]Ruslan Sadykov, François Vanderbeck:
Column Generation for Extended Formulations. Electron. Notes Discret. Math. 37: 357-362 (2011) - [j15]François Vanderbeck:
Branching in branch-and-price: a generic scheme. Math. Program. 130(2): 249-294 (2011) - 2010
- [j14]Cédric Joncour, Sophie Michel, Ruslan Sadykov, Dmitry Sverdlov, François Vanderbeck:
Column Generation based Primal Heuristics. Electron. Notes Discret. Math. 36: 695-702 (2010) - [p1]François Vanderbeck, Laurence A. Wolsey:
Reformulation and Decomposition of Integer Programs. 50 Years of Integer Programming 2010: 431-502
2000 – 2009
- 2009
- [j13]S. Michel, Nancy Perrot, François Vanderbeck:
Knapsack problems with setups. Eur. J. Oper. Res. 196(3): 909-918 (2009) - 2008
- [j12]Olivier Briant, Claude Lemaréchal, Philippe Meurdesoif, S. Michel, Nancy Perrot, François Vanderbeck:
Comparison of bundle and classical column generation. Math. Program. 113(2): 299-344 (2008) - 2007
- [j11]M. Mourgaya, François Vanderbeck:
Column generation based heuristic for tactical planning in multi-period vehicle routing. Eur. J. Oper. Res. 183(3): 1028-1041 (2007) - 2006
- [j10]François Vanderbeck, Martin W. P. Savelsbergh:
A generic view of Dantzig-Wolfe decomposition in mixed integer programming. Oper. Res. Lett. 34(3): 296-306 (2006) - [j9]M. Mourgaya, François Vanderbeck:
The periodic Vehicle routing problem: classification and heuristic. RAIRO Oper. Res. 40(2): 169-194 (2006) - 2002
- [j8]François Vanderbeck:
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem. Math. Program. 94(1): 125-136 (2002) - 2001
- [j7]François Vanderbeck:
A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem. Manag. Sci. 47(6): 864-879 (2001) - 2000
- [j6]François Vanderbeck:
On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm. Oper. Res. 48(1): 111-128 (2000) - [j5]François Vanderbeck:
Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem. Oper. Res. 48(6): 915-926 (2000)
1990 – 1999
- 1999
- [j4]Anantaram Balakrishnan, François Vanderbeck:
A Tactical Planning Model for Mixed-Model Electronics Assembly Operations. Oper. Res. 47(3): 395-409 (1999) - [j3]François Vanderbeck:
Computational study of a column generation algorithm for bin packing and cutting stock problems. Math. Program. 86(3): 565-594 (1999) - 1998
- [j2]Alain S. Sutter, François Vanderbeck, Laurence A. Wolsey:
Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms. Oper. Res. 46(5): 719-728 (1998) - 1996
- [j1]François Vanderbeck, Laurence A. Wolsey:
An exact algorithm for IP column generation. Oper. Res. Lett. 19(4): 151-159 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
