Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register. Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Gasmi, B"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • Loading...
    Thumbnail Image
    Item
    BRANCH AND BOUND METHOD TO RESOLVE NON CONVEX QUADRATIC PROBLEMS OVER A RECTANGLE OF
    (university of el oued/جامعة الوادي, 2019-01-01) Gasmi, B; Benacer, R
    We present in this paper a new convergence of the Branch and Bound method to resolve a class of non convex quadratic problems over a rectangle of Rn . We construct an approximate convex quadratics functions of the objective function in ordre to determinate the lower bound of the global optimal value of the original problem (NQP) over each subset of the feasible domain of the optimization problem. We applied the partition and reduction technical on the feasable domain t o accelerate the convergence of the proposed algorithm. Finally, we give a simple comparison between this method and another method wish has the same principle with examples.

DSpace software copyright © 2002-2025 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback