Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
RAIRO - Operations Research - Recherche Opérationnelle, Tome 27 (1993) no. 2, pp. 169-187. 
@article{RO_1993__27_2_169_0,
     author = {Fr\'eville, Arnaud and Plateau, G.},
     title = {Sac \`a dos multidimensionnel en variables 0-1 : encadrement de la somme des variables \`a l'optimum},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {169--187},
     publisher = {EDP-Sciences},
     volume = {27},
     number = {2},
     year = {1993},
     mrnumber = {1222386},
     zbl = {0777.90032},
     language = {fr},
     url = {http://www.numdam.org/item/RO_1993__27_2_169_0/}
}
TY  - JOUR
AU  - Fréville, Arnaud
AU  - Plateau, G.
TI  - Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1993
SP  - 169
EP  - 187
VL  - 27
IS  - 2
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/RO_1993__27_2_169_0/
LA  - fr
ID  - RO_1993__27_2_169_0
ER  - 
%0 Journal Article
%A Fréville, Arnaud
%A Plateau, G.
%T Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1993
%P 169-187
%V 27
%N 2
%I EDP-Sciences
%U http://www.numdam.org/item/RO_1993__27_2_169_0/
%G fr
%F RO_1993__27_2_169_0
Fréville, Arnaud; Plateau, G. Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum. RAIRO - Operations Research - Recherche Opérationnelle, Tome 27 (1993) no. 2, pp. 169-187. http://www.numdam.org/item/RO_1993__27_2_169_0/

[BOPL91] P. Bourgeois and G. Plateau, BPK90 : A Revisited Hybrid Algorithm for the 0-1 Knapsack Problem, Publication LIPN, 1991, n° 91-2.Université Paris-Nord.

[DYE80] H. E. Dyer, Calculating Surrogate Constraints, Mathematical Programming 19, 1980, p. 255-278. | MR | Zbl

[FAPL82] D. Fayard and G. Plateau, An Algorithm for the Solution of the 0-1 Knapsack Problem, Compting, 1982, 28, p. 269-287. | Zbl

[FAPL92] D. Fayard and G. Plateau, An Exact Algorithm for the 0-1 Collapsing Knapsack Problem. Proceedings de la conférence "Viewpoints on Optimization", Grimentz, Suisse, Août 1990, à paraître dans Discrete Applied Mathematics. | Zbl

[FLP90] A. Fréville, L. A. N. Lorena and G. Plateau, A Monotone Decreasing Algorithm for Solving the Surrogate Dual of 0-1 Multiknapsack Problems, Publication LIPN, 1990, n° 90-13, Université Paris-Nord.

[FRE91] A. Fréville, Contribution à l'optimisation en nombres entiers, Thèse d'habilitation à diriger des recherches, Université Paris-Nord, 1991.

[FRPL86] A. Fréville and G. Plateau, Heuristics and Reduction Methods for Multiple Constraints 0-1 Linear Programming Problems, European Journal of Operational Research, 1986, 24, p. 206-215. | MR | Zbl

[FRPL90] A. Fréville and G. Plateau, Hard 0-1 Multiknapsack Test Problems for Size Reduction Methods, Investigation Operativa 1, 1990, p. 251-270.

[FRPL92a] A. Fréville and G. Plateau, An Efficient Preprocessing Procedure for the Solution of the 0-1 Multiknapsack Problem, Proceedings de la conférence "Viewpoints on Optirnization", Grimentz, Suisse, août 1990, à paraître dans Discrete Applied Mathematics. | Zbl

[FRPL92b] A. Fréville and G. Plateau, FPBK92 : An Implicit Enumeration Code for the Solution of the 0-1 Bidimensional Knapsack Problem Based on Surrogate Duality, Graphs and Optimization Colloquium, Grimentz, Suisse, août 1992. | Zbl

[FRPL93] A. Fréville and G. Plateau, SADE2 : An Exact Algorithm for Solving the Biknapsack Surrogate Dual, à paraître dans European Journal of Operational Research, 66, 1993.

[GAPI85] B. Gavish and H. Pirkul, Efficient Algorithms for Solving Multiconstraint Zero-One Knapsack Problems to Optimality, Mathematical Programming, 1985, 31, p. 78-105. | MR | Zbl

[GLO65] F. Glover, A Multiphase Dual Algorithm for the Zero-One Integer Programming Problem Operations Research, 1965, 13 (6), p. 879-919. | Zbl

[MAMA57] A. S Manne and H. M. Markowitz, On the Solution of Discrete Programming Problems, Econometrica, 1957, 25, p. 84-110. | MR | Zbl

[MATO92] S. Martello and P. Toth, Exact Solution of Hard Knapsack Problems, EURO XII-TIMS XXXI, Helsinki, Finlande, juin 1992.

[PET67] C. C. Petersen, Computational Experience With Variants of the Balas Algorithm Applied to the Selection for R & D Projects, Management Science, 1967, 13 (9), p. 736-750.

[SETO68] S. Senju and Y. Toyoda, An Approach to Linear Programming with 0-1 Variables, Management Science, 1968, 15 (4), p. 196-205.

[WENE67] H. M. Weingartner and D. N. Ness, Method for the Solution of the Multidimensional 0-1 Knapsack Problem, Operations Research, 1967, 15 (1), p. 83-103.