Comparaison de deux méthodes de résolution d'un problème combinatoire quadratique

J. C. Hennet

RAIRO - Operations Research - Recherche Opérationnelle (1983)

  • Volume: 17, Issue: 3, page 285-295
  • ISSN: 0399-0559

How to cite

top

Hennet, J. C.. "Comparaison de deux méthodes de résolution d'un problème combinatoire quadratique." RAIRO - Operations Research - Recherche Opérationnelle 17.3 (1983): 285-295. <http://eudml.org/doc/104836>.

@article{Hennet1983,
author = {Hennet, J. C.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {quadratic performance criterion; implicit enumeration algorithm; relaxation; combinatorial optimization},
language = {fre},
number = {3},
pages = {285-295},
publisher = {EDP-Sciences},
title = {Comparaison de deux méthodes de résolution d'un problème combinatoire quadratique},
url = {http://eudml.org/doc/104836},
volume = {17},
year = {1983},
}

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 - Recherche Opérationnelle
PY - 1983
PB - EDP-Sciences
VL - 17
IS - 3
SP - 285
EP - 295
LA - fre
KW - quadratic performance criterion; implicit enumeration algorithm; relaxation; combinatorial optimization
UR - http://eudml.org/doc/104836
ER -

References

top
  1. R. BELLMAN, Dynamic Programming, Princeton University Press, Princeton, H.J., 1957. Zbl1205.90002MR90477
  2. 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. Zbl0238.90043MR309548
  3. 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. Zbl0272.90049
  4. 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. Zbl0415.90058MR537064
  5. P. HANSEN, Quadratic 0-1 Programming by Implicit Enumeration, in Numerical Methods for Non Linear Optimization, LOOTSMA, éd., Academic Press, 1972, p. 282-296. MR384129
  6. J. C. HENNET, Étude des effets d'ombre entre héliostats d'une centrale solaire, Note interne LAAS-ASE, novembre 1980. 
  7. J. C. HENNET, Resolution of a Quadratic Combinatorial Problem by Dynamic Programming, IFIP Conference, New York, 1981. Zbl0484.49015
  8. 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. Zbl0443.90067MR591285
  9. R. M. NAUSS, An Efficient Algorithm for the 0-1 Knapsack Problem, Management Science, vol. 23, n° 1, septembre 1976. Zbl0337.90042
  10. G. L. NEMHAUSER et Z. ULLMAN, Discrete Dynamic Programming and Capital Allocation, Management Science, vol. 15, 1969, p. 494-505. Zbl1231.90339MR381680
  11. J. C. HENNET et J. L. ABATUT, An Analytical Method for Reflected Flux Density Calculations, Solar World Forum, Brighton, 1981. 
  12. G. GALLA, P. L. HAMMER et B. SIMEONE, Quadratic Knapsack Problems, Math. Prog. study, vol. 12, 1980, p. 132-149. Zbl0462.90068MR571860

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.