no. 3
Comparaison de deux méthodes de résolution d'un problème combinatoire quadratique
RAIRO. Operations research, Tome 17 (1983) no. 3, pp. 285-295 
@article{RO_1983__17_3_285_0,
     author = {Hennet, J. C.},
     title = {Comparaison de deux m\'ethodes de r\'esolution d'un probl\`eme combinatoire quadratique},
     journal = {RAIRO. Operations research},
     pages = {285--295},
     year = {1983},
     publisher = {EDP-Sciences},
     volume = {17},
     number = {3},
     mrnumber = {727266},
     zbl = {0525.90073},
     language = {fr},
     url = {https://www.numdam.org/item/RO_1983__17_3_285_0/}
}
TY  - JOUR
AU  - Hennet, J. C.
TI  - Comparaison de deux méthodes de résolution d'un problème combinatoire quadratique
JO  - RAIRO. Operations research
PY  - 1983
SP  - 285
EP  - 295
VL  - 17
IS  - 3
PB  - EDP-Sciences
UR  - https://www.numdam.org/item/RO_1983__17_3_285_0/
LA  - fr
ID  - RO_1983__17_3_285_0
ER  - 
%0 Journal Article
%A Hennet, J. C.
%T Comparaison de deux méthodes de résolution d'un problème combinatoire quadratique
%J RAIRO. Operations research
%D 1983
%P 285-295
%V 17
%N 3
%I EDP-Sciences
%U https://www.numdam.org/item/RO_1983__17_3_285_0/
%G fr
%F RO_1983__17_3_285_0
Hennet, J. C. Comparaison de deux méthodes de résolution d'un problème combinatoire quadratique. RAIRO. Operations research, Tome 17 (1983) no. 3, pp. 285-295. https://www.numdam.org/item/RO_1983__17_3_285_0/

R. Bellman, Dynamic Programming, Princeton University Press, Princeton, H.J., 1957. | Zbl | MR

A. M. Geoffrion et R. E. Marsten, Integer Programming Algorithms: A Framework and a State-of-the-Art Survey, Management Science, vol. 18, n° 9, mai 1972, p. 465-491. | Zbl | MR

F. Glover et R. E. Wolsey, Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program, Operations Research, vol. 22, 1974, p. 180-182. | Zbl

D. Granot, F. Granot et J. Kallberg, Covering Relaxation for Positive 0-1 Polynomial Programs, Management Science, vol. 25, n° 3, mars 1979, p. 264-273. | Zbl | MR

P. Hansen, Quadratic 0-1 Programming by Implicit Enumeration, in Numerical Methods for Non Linear Optimization, LOOTSMA, éd., Academic Press, 1972, p. 282-296. | MR

J. C. Hennet, Étude des effets d'ombre entre héliostats d'une centrale solaire, Note interne LAAS-ASE, novembre 1980.

J. C. Hennet, Resolution of a Quadratic Combinatorial Problem by Dynamic Programming, IFIP Conference, New York, 1981. | Zbl

R. D. Mcbride et J. S. Yormark, An Implicit Enumeration Algorithm for Quadratic Integer Programming, Management Science, vol. 26, n° 3, mars 1980, p. 282-296. | Zbl | MR

R. M. Nauss, An Efficient Algorithm for the 0-1 Knapsack Problem, Management Science, vol. 23, n° 1, septembre 1976. | Zbl

G. L. Nemhauser et Z. Ullman, Discrete Dynamic Programming and Capital Allocation, Management Science, vol. 15, 1969, p. 494-505. | MR | Zbl

J. C. Hennet et J. L. Abatut, An Analytical Method for Reflected Flux Density Calculations, Solar World Forum, Brighton, 1981.

G. Galla, P. L. Hammer et B. Simeone, Quadratic Knapsack Problems, Math. Prog. study, vol. 12, 1980, p. 132-149. | Zbl | MR