default search action
Christophe Wilbaut
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Song Wu
, Wei Yang, Saïd Hanafi, Christophe Wilbaut
Iterated local search with ejection chains for the space-free multi-row facility layout problem. Eur. J. Oper. Res. 316(3): 873-886 (2024) - 2023
- [j16]Christophe Wilbaut
Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem. Eur. J. Oper. Res. 304(3): 901-911 (2023) - 2022
- [j15]Christophe Wilbaut
Variable neighborhood search for the discounted {0-1} knapsack problem. Appl. Soft Comput. 131: 109821 (2022) - 2021
- [j14]Marko Mladenovic, Thierry Delot
A scalable dynamic parking allocation framework. Comput. Oper. Res. 125: 105080 (2021) - 2020
- [j13]Marko Mladenovic
The parking allocation problem for connected vehicles. J. Heuristics 26(3): 377-399 (2020)
2010 – 2019
- 2019
- [c4]Igor Crévits, Saïd Hanafi, Ali Ridha Mahjoub, Raouia Taktak, Christophe Wilbaut
A special case of Variable-Sized Bin Packing Problem with Color Constraints. CoDIT 2019: 1150-1154 - 2016
- [j12]Boukthir Haddar
A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem. Eng. Appl. Artif. Intell. 55: 1-13 (2016) - 2015
- [j11]Boukthir Haddar
A hybrid heuristic for the 0-1 Knapsack Sharing Problem. Expert Syst. Appl. 42(10): 4653-4666 (2015) - 2013
- [j10]Adrien Bellanger
Three-stage hybrid-flowshop model for cross-docking. Comput. Oper. Res. 40(4): 1109-1121 (2013) - 2012
- [j9]Igor Crévits, Saïd Hanafi, Raïd Mansi, Christophe Wilbaut
Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem. Comput. Oper. Res. 39(1): 32-41 (2012) - [j8]Saïd Hanafi, Raïd Mansi, Christophe Wilbaut
Hybrid approaches for the two-scenario max-min knapsack problem. Int. Trans. Oper. Res. 19(3): 353-378 (2012) - 2011
- [j7]Saïd Hanafi, Christophe Wilbaut
Improved convergent heuristics for the 0-1 multidimensional knapsack problem. Ann. Oper. Res. 183(1): 125-142 (2011) - [j6]Hideki Hashimoto, Sylvain Boussier, Michel Vasquez, Christophe Wilbaut
A GRASP-based approach for technicians and interventions scheduling for telecommunications. Ann. Oper. Res. 183(1): 143-161 (2011) - 2010
- [j5]Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic
Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem. Electron. Notes Discret. Math. 36: 883-890 (2010) - [c3]Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic
New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem. Hybrid Metaheuristics 2010: 118-132 - [c2]Minh Hoang Ha, François Clautiaux, Saïd Hanafi, Christophe Wilbaut
New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint. SEA 2010: 302-313
2000 – 2009
- 2009
- [j4]Christophe Wilbaut
New convergent heuristics for 0-1 mixed integer programming. Eur. J. Oper. Res. 195(1): 62-74 (2009) - [j3]Christophe Wilbaut
An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem. Eur. J. Oper. Res. 199(2): 339-348 (2009) - [j2]Sylvain Boussier, Hideki Hashimoto, Michel Vasquez, Christophe Wilbaut
Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications. RAIRO Oper. Res. 43(4): 387-407 (2009) - [c1]Saïd Hanafi, Raïd Mansi, Christophe Wilbaut
Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem. Hybrid Metaheuristics 2009: 73-83 - 2008
- [j1]Saïd Hanafi, Christophe Wilbaut
Scatter Search for the 0-1 Multidimensional Knapsack Problem. J. Math. Model. Algorithms 7(2): 143-159 (2008) - 2006
- [b1]Christophe Wilbaut:
Heuristiques hybrides pour la résolution de problèmes en variables 0-1 mixtes. (Hybrid heuristics for 0-1 mixed integer programming). University of Valenciennes and Hainaut-Cambresis, France, 2006
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-10-07 22:14 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: