Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Arnaud Fréville"'
Publikováno v:
European Journal of Operational Research. 304:901-911
Publikováno v:
SSRN Electronic Journal.
Publikováno v:
International Transactions in Operational Research. 19:353-378
In this paper, we deal with the two-scenario max–min knapsack (MNK) problem. First, we consider several formulations of MNK as a mixed integer programming problem. Then, we propose a hybrid method as an alternative to solve the MNK exactly. The app
Autor:
Arnaud Fréville, Saïd Hanafi
Publikováno v:
Annals of Operations Research. 139:195-227
The multidimensional 0-1 knapsack problem (MKP) is a resource allocation model that is one of the most well-known integer programming problems. During the last few decades, an impressive amount of research on the 0-1 knapsack problem has been publish
Autor:
Arnaud Fréville
Publikováno v:
European Journal of Operational Research. 155:1-21
The multidimensional 0–1 knapsack problem is one of the most well-known integer programming problems and has received wide attention from the operational research community during the last four decades. Although recent advances have made possible t
Autor:
Arnaud Fréville, Saïd Hanafi
Publikováno v:
RAIRO - Operations Research. 35:251-267
The Reverse Elimination Method (REM) is a dynamic strategy for managing the tabu list. It is based on logical interdependencies between the solutions encountered during recent iterations of the search. REM provides both a necessary and sufficient con
Autor:
Arnaud Fréville, Xavier Gandibleux
Publikováno v:
Journal of Heuristics. 6:361-383
We consider in this paper the solving of 0-1 knapsack problems with multiple linear objectives. We present a tabu search approach to generate a good approximation of the efficient set. The heuristic scheme is included in a redu tion decision space fr
Publikováno v:
INFOR: Information Systems and Operational Research. 37:236-254
This paper deals with the crucial sectorization problem regarding household waste collection. Our purpose is to construct a fixed number of sectors which should be balanced with respect to daily to...
Autor:
Arnaud Fréville, Saïd Hanafi
Publikováno v:
European Journal of Operational Research. 106:659-675
In this paper, we describe a new approach to tabu search (TS) based on strategic oscillation and surrogate constraint information that provides a balance between intensification and diversification strategies. New rules needed to control the oscillat
Autor:
Gérard Plateau, Arnaud Fréville
Publikováno v:
Discrete Applied Mathematics. 49:189-212
The multidimensional 0–1 knapsack problem, defined as a knapsack with multiple resource constraints, is well known to be much more difficult than the single constraint version. This paper deals with the design of an efficient preprocessing procedur