Skip to main content

Fonctions D’evaluation Et Penalites Pour Les Programmes Quadratiques En Variables 0–1

  • Conference paper
Book cover Combinatorial Programming: Methods and Applications

Part of the book series: NATO Advanced Study Institutes Series ((ASIC,volume 19))

Resume

On propose une série de fonctions d’évaluation, de plus en plus précises, pour les programmes quadratiques en variables 0–1; ces fonctions d’évaluation sont obtenues grâce à des pénalités additives et non additives. On présente aussi les résultats d’essais comparatifs sur ordinateur de trois algorithmes utilisant une partie ou l’ensemble des fonctions d’évaluation et des pénalités obtenues.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographie

  1. M.L. Balinski, On a Selection Problem, Manag.Sci. 17, 230, 1970.

    Article  MathSciNet  MATH  Google Scholar 

  2. J. de Smet, Le problème des signes de Thurstone, Revue Fr. Infor. Rech. Opér., 2, 33, 1968.

    MATH  Google Scholar 

  3. M. Despontin, D. Van Oudheusden and P. Hansen, Choix de médias par programmation quadratique en variables 0–1, dans les actes du colloque de l’AFCET Aide à la décision, tome 1, 1, 1974.

    Google Scholar 

  4. L. Ford and D.R. Fulkerson, Flows in Networks, Princeton, 1962.

    MATH  Google Scholar 

  5. V. Ginsburgh et A. Van Peetersen, Un algorithme de programmation quadratique en variables binaires, Revue Fr. Infor. Rech. Opér., 3, 57, 1969.

    MATH  Google Scholar 

  6. P.L. Hammer, Pseudo-Boolean Remarks on Balanced Graphs, Technion, 1969.

    Google Scholar 

  7. P.L. Hammer and P. Hansen, Quadratic 0–1 Programming, CORE discussion paper 7219, 1972.

    Google Scholar 

  8. P.L. Hammer and A.A. Rubin, Quadratic Programming with 0–1 Variables, Technion, 1969.

    Google Scholar 

  9. P.L. Hammer and A.A. Rubin, Some Remarks on Quadratic Programming with 0–1 Variables, Revue Fr. Infor. Rech. Opér., 4, 67, 1970.

    MathSciNet  Google Scholar 

  10. P.L. Hammer and Rudeanu, Boolean Methods in Operations Research and Related Areas, Springer, Heidelberg, 1968.

    MATH  Google Scholar 

  11. P. Hansen, Pénalités additives pour les programmes en variables 0–1, Comptes-Rendus Acad. Sci. Paris, 273, 175, 1971.

    MATH  Google Scholar 

  12. P. Hansen, Quadratic 0–1 Programming by Implicit Enumeration, in Numerical Methods in Nonlinear Optimization, ed. by F.A. Lootsma, Academic Press, New-York, 1972.

    Google Scholar 

  13. P. Hansen, Minimisation d’une fonction quadratique en variables 0–1 par l’algorithme de Ford et Fulkerson, papier présenté au colloque Structures Economiques et Econométrie, Lyon, 1973.

    Google Scholar 

  14. P. Hansen, Programmes Mathématiques en Variables 0 – 1, thèse d’agrégation de l’enseignement supérieur, Université Libre de Bruxelles, 1974.

    Google Scholar 

  15. F.S. Hillier, The Evaluation of Risky Interrelated Investments, North-Holland, Amsterdam, 1969.

    Google Scholar 

  16. D.J. Laughhunn, Quadratic Binary Programming with Applications to Capital Budgeting Problems, Oper. Res., 18, 454, 1970.

    Article  MATH  Google Scholar 

  17. D.J. Laughhunn and D.E. Peterson, Capital Expenditure Programming and Some Alternative Approaches to Risk, Manag. Sci., 17, 320, 1971.

    Article  MATH  Google Scholar 

  18. E.L. Lawler and M.D. Bell, A Method for Solving Discrete Optimization Problems, Oper. Res., 14, 1098, 1966.

    Article  Google Scholar 

  19. J.C.T. Mao and B.A. Wallingford, An Extension of Lawler and Bell’s Method of Discrete Optimization with Examples from Capital Budgeting, Manag.Sci., 15, 51, 1968.

    Article  Google Scholar 

  20. J. Rhys, A Selection Problem of Shared Fixed Costs and Network Flows, Manag.Sci., 17, 200, 1970.

    Article  MATH  Google Scholar 

  21. M. Schecter and P.L. Hammer, A Note on the Dynamic Planning of Investment Projects, Eur. Econ. Rev., 2, 111, 1970.

    Article  Google Scholar 

  22. R.M. Weingartner, Capital Budgeting of Interrelated Projects, Manag.Sci., 12, 485, 1966.

    Article  Google Scholar 

  23. W. Zangwill, Media Selection by Decision Programming, J. of Adv. Res., 5, 30, 1965.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1975 D. Reidel Publishing Company, Dordrecht-Holland

About this paper

Cite this paper

Hansen, P. (1975). Fonctions D’evaluation Et Penalites Pour Les Programmes Quadratiques En Variables 0–1. In: Roy, B. (eds) Combinatorial Programming: Methods and Applications. NATO Advanced Study Institutes Series, vol 19. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-7557-9_21

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-7557-9_21

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-011-7559-3

  • Online ISBN: 978-94-011-7557-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics