Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

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

inglise keel
2020-01-22
59,28 € 84,68 €

-30% koodiga BOOKS

Meie tarnija laos

Saadetis 15-21 tööpäeva jooksul

30-päevane tagastamisõigus

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.

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Autor Stefan Rocktäschel
Kirjastaja Springer Fachmedien Wiesbaden
Series BestMasters
Väljalaskeaasta 2020
Kaanetüüp Pehme kaanega
EAN 9783658291488
Kirjuta oma arvustus
Te vaatate: A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Teie hinnang:

Goodreads'i arvustused

59,28 € 84,68 €