Pensum -10%
Modern Numerical Nonlinear Optimization
Neculai Andrei
PocketEngelsk
Del av serien Springer Optimization and Its Applications
Hopp til hovedinnholdet
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Av Stefan Rocktäschel, 2020.Del av serien BestMasters.
Stefan Rocktaschel 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.
PocketEngelsk
Normalpris: 649,-
584,-
Spar 65,-
Laveste pris siste 30 dager: 339,-
Ikke tilgjengelig for Klikk&Hent
Midlertidig tomt på lager
Bestillingsvare. Forventes sendt om ca 20 dager
Oppdag mer
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Av Stefan Rocktäschel, 2020.Del av serien BestMasters.
Stefan Rocktaschel 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.
Oppdag mer
Normalpris: 649,-
584,-
Spar 65,-
Laveste pris siste 30 dager: 339,-
PocketEngelsk
Ikke tilgjengelig for Klikk&Hent
Midlertidig tomt på lager
Bestillingsvare. Forventes sendt om ca 20 dager
584,-
Ved å fullføre kjøpet aksepterer du kjøpsvilkårene.
