Une application de la notion de dualité en programmation en nombres entiers : sélection et affectation optimales d'une flotte d'avions

J.-P. Legendre; M. Minoux

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

  • Volume: 11, Issue: 2, page 201-222
  • ISSN: 0399-0559

How to cite

top

Legendre, J.-P., and Minoux, M.. "Une application de la notion de dualité en programmation en nombres entiers : sélection et affectation optimales d'une flotte d'avions." RAIRO - Operations Research - Recherche Opérationnelle 11.2 (1977): 201-222. <http://eudml.org/doc/104661>.

@article{Legendre1977,
author = {Legendre, J.-P., Minoux, M.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
language = {fre},
number = {2},
pages = {201-222},
publisher = {EDP-Sciences},
title = {Une application de la notion de dualité en programmation en nombres entiers : sélection et affectation optimales d'une flotte d'avions},
url = {http://eudml.org/doc/104661},
volume = {11},
year = {1977},
}

TY - JOUR
AU - Legendre, J.-P.
AU - Minoux, M.
TI - Une application de la notion de dualité en programmation en nombres entiers : sélection et affectation optimales d'une flotte d'avions
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1977
PB - EDP-Sciences
VL - 11
IS - 2
SP - 201
EP - 222
LA - fre
UR - http://eudml.org/doc/104661
ER -

References

top
  1. 1. J. AGARD, J. SUDAROVICH et F. HEMMER, Sélection et affectation optimales d'une flotte d'avions, R.A.I.R.O., 7e année, V-2, mai 1973, p. 3-26. 
  2. 2. M. HELD et R. M. KARP, The Traveling Salesman Problem and Minimum Spanning Trees, Mathematical Programming, vol. 1, n° 1, 1971, p. 6-25. Zbl0232.90038MR289119
  3. 3. M. HELD, P. WOLFE et H. P. CROWDER, Validation of Subgradient Optimization, Mathematical Programming, vol. 6, n° 1, 1974, p. 62-88. Zbl0284.90057MR341863
  4. 4. M. L. FISCHER et J. F. SHAPIRO, Constructive Duality in Integer Programming Working paper O. R. 008-72 Operation Research Center M.I.T., Cambridge, Mass., avril 1972. 
  5. 5. S. AGMON, The Relaxation Method for Linear Inequalities, Canad. J. Math., vol. 6, 1974, p. 382-392. Zbl0055.35001MR62786
  6. 6. T. MOTZKIN et I. J. SCHOENBERG, The Relaxation Method for Linear Inequalities, Canad. J. Math., vol. 6, 1974, p. 393-404. Zbl0055.35002MR62787
  7. 7. P. WOLFE, M. HELD et R. M. KARP, Large scale optimization and the relaxation method, in: Proceedings of the 25th Nat. A.C.M. meeting Boston, Massassuchets, 1972. 
  8. 8. C. LEMARÉCHAL, Méthodes de sous-gradients, Bulletin de la Direction des Études et Recherches EDF, série C, n° 2, 1974, p. 5-14. MR398098
  9. 9. P. WOLFE, A Method of Conjugate Subgradients for Minimizing Non Differentiable Functions, Mathematical Programming (à paraître). Zbl0369.90093
  10. 10. M. MINOUX, Plus court chemin avec contraintes supplémentaires, Annales des Télécommunications, t. 30, nos 11-12, 1975. 
  11. 11. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, 1970. Zbl0932.90001MR274683
  12. 12. L. S. LASDON, Optimization Theory for Large Systems, Macmillan series for Ops. Res., 1970. Zbl0224.90038MR337317
  13. 13. R. C. GRINOLD, Steepest Ascent for Large Scale Linear Programs, S.I.A.M. Rev., vol. 14, 1972, p. 447-464. Zbl0281.90044MR307693
  14. 14. B. T. POLJAK, A General Method of Solving Extremum Problems, Sov. Math. Doklady, vol. 8, 1967, p. 593-597. Zbl0177.15102
  15. 15. B. T. POLJAK, Minimization of Unsmooth Functionals, U.S.S.R. Computational Math. and Math. Physics, 1969. Zbl0229.65056
  16. 16. G. B. DANTZIG et P. WOLFE, Decomposition Principle for Linear Programs, J. ORSA, vol. 8, n° 1, 1960, p. 101-111. Zbl0093.32806
  17. 17. J. FARKAS, Über die Theorie der einfachen Ungleichungen, Journal für die reine und angewandte Mathematik, vol. 124, 1901, p. 1-27. Zbl32.0169.02JFM32.0169.02
  18. 18. G. T. ROSS et R. M. SOLAND, A Branch and Bound Algorithm for the Generalized Assignment Problem, Mathematical Programming, vol. 8, 1975, p. 91-103. Zbl0308.90028MR368757

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.