Arnaud Fréville

Orcid: 0000-0001-7537-1189

According to our database1, Arnaud Fréville authored at least 15 papers between 1994 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem.
Eur. J. Oper. Res., 2023

2022
Variable neighborhood search for the discounted {0-1} knapsack problem.
Appl. Soft Comput., 2022

2012
Hybrid approaches for the two-scenario max-min knapsack problem.
Int. Trans. Oper. Res., 2012

2010
A tabu search with an oscillation strategy for the discriminant analysis problem.
Comput. Oper. Res., 2010

2008
A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem.
Eur. J. Oper. Res., 2008

2005
The Multidimensional 0-1 Knapsack Problem - Bounds and Computational Aspects.
Ann. Oper. Res., 2005

2004
The multidimensional 0-1 knapsack problem: An overview.
Eur. J. Oper. Res., 2004

2001
Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List.
RAIRO Oper. Res., 2001

Medical images compression by neural networks.
Proceedings of the Second International Workshop on Models and Analysis of Vocal Emissions for Biomedical Applications, 2001

2000
Tabu Search Based Procedure for Solving the 0-1 MultiObjective Knapsack Problem: The Two Objectives Case.
J. Heuristics, 2000

1999
A Parallel Branch-and-Bound Algorithm for the Classification Problem.
Proceedings of the High Performance Computing, 1999

1998
An efficient tabu search approach for the 0-1 multidimensional knapsack problem.
Eur. J. Oper. Res., 1998

1997
A Parallel Tabu Search Algorithm For The 0-1 Multidimensional Knapsack Problem.
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

1996
The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool.
J. Heuristics, 1996

1994
An Efficient Preprocessing Procedure for the Multidimensional 0- 1 Knapsack Problem.
Discret. Appl. Math., 1994


  Loading...