Une application de la notion de dualité en programmation en nombres entiers : sélection et affectation optimales d'une flotte d'avions
Open Access
- 1 January 1977
- journal article
- Published by EDP Sciences in Rairo-Operations Research
- Vol. 11 (2) , 201-222
- https://doi.org/10.1051/ro/1977110202011
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A branch and bound algorithm for the generalized assignment problemMathematical Programming, 1975
- Validation of subgradient optimizationMathematical Programming, 1974
- Sélection et affectation optimales d'une flotte d'avionsRevue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle, 1973
- Steepest Ascent for Large Scale Linear ProgramsSIAM Review, 1972
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- Decomposition Principle for Linear ProgramsOperations Research, 1960
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954
- Theorie der einfachen Ungleichungen.Journal für die reine und angewandte Mathematik (Crelles Journal), 1902