Bezmaksas piegāde pasūtījumiem virs 29€

  • check 10+ miljoni grāmatu
  • check Jaunumi katru dienu
  • check Vairāk nekā 1 miljons klientu mums uzticas
  • check Labas cenas un atlaides
  • check Piegāde visā Eiropā

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization - Stefan Rocktäschel

angļu valoda
2020-01-22
59,28 € 84,68 €

-30% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 15-21 darba dienu laikā

30 dienu atgriešanas politika

Stefan Rocktäschel introduces a branch-and-bound algorithm that determines a cover of the efficient set of multiobjective mixed-integer convex optimization problems. He examines particular steps of this algorithm in detail and enhances the basic algorithm with additional modifications that ensure a more precise cover of the efficient set. Finally, he gives numerical results on some test instances.

Jums varētu patikt arī

Aprašymas

Stefan Rocktäschel introduces a branch-and-bound algorithm that determines a cover of the efficient set of multiobjective mixed-integer convex optimization problems. He examines particular steps of this algorithm in detail and enhances the basic algorithm with additional modifications that ensure a more precise cover of the efficient set. Finally, he gives numerical results on some test instances.

Vairāk informācijas

Autors Stefan Rocktäschel
Izdevējs Springer Fachmedien Wiesbaden
Series BestMasters
Izlaides gads 2020
Vāka tips Mīkstais vāks
EAN 9783658291488
Rakstiet savu atsauksmi
Jūs vērtējat: A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Jūsu novērtējums:

Goodreads atsauksmes

59,28 € 84,68 €