Springer Nature
A Branch-And-Bound Algorithm For Multiobjective Mixed-Integer Convex Optimization
Miglior prezzo disponibile
54,99$
Springer Nature · Spedizione gratuita
VISAPayPal
Prezzi aggiornati
Specifiche
MarcaSpringer Nature
CondizioneNuovo
Descrizione
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.
Storico prezzi
Ricevi una notifica se il prezzo scende
Ti invieremo un'email quando il prezzo di questo prodotto diminuirà.
- Aggiornamenti dei prezzi in tempo reale
- Oltre 50 negozi monitorati
- Avvisi gratuiti di calo prezzo
- Solo negozi verificati
Avvisami quando il prezzo scende sotto: 54,99$
Prodotti simili
Una selezione di prodotti che potrebbero interessarti. Guarda tutti
A Branch-And-Bound Algorithm For Multiobjective Mixed-Integer Convex Optimization
39,99$
Linear And Mixed Integer Programming For Portfolio Optimization
69,99$
Convexification And Global Optimization In Continuous And Mixed-Integer Nonlinear Programming
219,99$
Large Scale Linear And Integer Optimization: A Unified Approach
599,00$
Dual-Feasible Functions For Integer Programming And Combinatorial Optimization
39,99$
Relaxation And Decomposition Methods For Mixed Integer Nonlinear Programming
109,99$
Totally Convex Functions For Fixed Points Computation And Infinite Dimensional Optimization
54,99$
A5, 5.5" X 8.5" 1 Pack, 50 Sheets - Spiral Bound Mixed Media Sketchbook For Drawing, Doodling, Sketching And Painting - Acid Fr
51,83$