Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
RAIRO-Oper. Res., 27 2 (1993) 169-187
Published online: 2017-02-06
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Algorithms and Complexity Results for Genome Mapping Problems
Ashok Rajaraman, Joao Paulo Pereira Zanetti, Jan Manuch and Cedric ChauveIEEE/ACM Transactions on Computational Biology and Bioinformatics 14 (2) 418 (2017)
https://doi.org/10.1109/TCBB.2016.2528239
A hybrid heuristic for the 0–1 Knapsack Sharing Problem
Boukthir Haddar, Mahdi Khemakhem, Saïd Hanafi and Christophe WilbautExpert Systems with Applications 42 (10) 4653 (2015)
https://doi.org/10.1016/j.eswa.2015.01.049
Improved convergent heuristics for the 0-1 multidimensional knapsack problem
Saïd Hanafi and Christophe WilbautAnnals of Operations Research 183 (1) 125 (2011)
https://doi.org/10.1007/s10479-009-0546-z
Scatter Search for the 0–1 Multidimensional Knapsack Problem
Said Hanafi and Christophe WilbautJournal of Mathematical Modelling and Algorithms 7 (2) 143 (2008)
https://doi.org/10.1007/s10852-008-9078-9
The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects
Arnaud Fréville and SaÏd HanafiAnnals of Operations Research 139 (1) 195 (2005)
https://doi.org/10.1007/s10479-005-3448-8
The multidimensional 0–1 knapsack problem: An overview
Arnaud FrévilleEuropean Journal of Operational Research 155 (1) 1 (2004)
https://doi.org/10.1016/S0377-2217(03)00274-1
Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
Michel Vasquez and Jin-Kao HaoRAIRO - Operations Research 35 (4) 415 (2001)
https://doi.org/10.1051/ro:2001123
Tabu Search Based Procedure for Solving the 0-1 MultiObjective Knapsack Problem: The Two Objectives Case
Xavier Gandibleux and Arnaud FrevilleJournal of Heuristics 6 (3) 361 (2000)
https://doi.org/10.1023/A:1009682532542