default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArnaud Fréville
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Christophe Wilbaut
, Raca Todosijevic, Saïd Hanafi, Arnaud Fréville:
Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem. Eur. J. Oper. Res. 304(3): 901-911 (2023)- 2022
- [j11]Christophe Wilbaut, Raca Todosijevic, Saïd Hanafi, Arnaud Fréville:
Variable neighborhood search for the discounted {0-1} knapsack problem. Appl. Soft Comput. 131: 109821 (2022)
2010 – 2019
- 2012
- [j10]Saïd Hanafi, Raïd Mansi, Christophe Wilbaut, Arnaud Fréville:
Hybrid approaches for the two-scenario max-min knapsack problem. Int. Trans. Oper. Res. 19(3): 353-378 (2012) - 2010
- [j9]Arnaud Fréville, Saïd Hanafi, Frédéric Semet, Nicola Yanev:
A tabu search with an oscillation strategy for the discriminant analysis problem. Comput. Oper. Res. 37(10): 1688-1696 (2010)
2000 – 2009
- 2008
- [j8]Stefan Balev, Nicola Yanev, Arnaud Fréville, Rumen Andonov:
A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem. Eur. J. Oper. Res. 186(1): 63-76 (2008) - 2005
- [j7]Arnaud Fréville, Saïd Hanafi:
The Multidimensional 0-1 Knapsack Problem - Bounds and Computational Aspects. Ann. Oper. Res. 139(1): 195-227 (2005) - 2004
- [j6]Arnaud Fréville:
The multidimensional 0-1 knapsack problem: An overview. Eur. J. Oper. Res. 155(1): 1-21 (2004) - 2001
- [j5]Saïd Hanafi, Arnaud Fréville:
Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List. RAIRO Oper. Res. 35(2): 251-267 (2001) - [c3]Zakaria Benahmed Daho, Nacéra Benamrane, Arnaud Fréville:
Medical images compression by neural networks. MAVEBA 2001: 169-175 - 2000
- [j4]Xavier Gandibleux, Arnaud Fréville:
Tabu Search Based Procedure for Solving the 0-1 MultiObjective Knapsack Problem: The Two Objectives Case. J. Heuristics 6(3): 361-383 (2000)
1990 – 1999
- 1999
- [c2]Stephan Balev, Rumen Andonov, Arnaud Fréville:
A Parallel Branch-and-Bound Algorithm for the Classification Problem. HiPC 1999: 274-278 - 1998
- [j3]Saïd Hanafi, Arnaud Fréville:
An efficient tabu search approach for the 0-1 multidimensional knapsack problem. Eur. J. Oper. Res. 106(2-3): 659-675 (1998) - 1997
- [c1]Smaïl Niar, Arnaud Fréville:
A Parallel Tabu Search Algorithm For The 0-1 Multidimensional Knapsack Problem. IPPS 1997: 512-516 - 1996
- [j2]Arnaud Fréville, Gérard Plateau:
The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool. J. Heuristics 2(2): 147-167 (1996) - 1994
- [j1]Arnaud Fréville, Gérard Plateau:
An Efficient Preprocessing Procedure for the Multidimensional 0- 1 Knapsack Problem. Discret. Appl. Math. 49(1-3): 189-212 (1994)
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-08-02 20:19 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:
