A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
☆☆☆☆☆
(0 reviews)
Lowest price (incl. delivery)
7 149,00 JPY
Typical price314,07 PLN
Lowest (90 days)39,99 PLN
Offers2
Last updated14 saat önce
| Satıcı | Product price | Delivery | Toplam | Stok Durumu | Updated | |
|---|---|---|---|---|---|---|
| SP Springer Nature Author | 7 149,00 JPY | free | 7 149,00 JPY | Mevcut | 14 saat önce | View offer |
| SP SpringerNatureLink Shop INT | 59,00 EUR | 25,00 EUR | 84,00 EUR | Mevcut | 1 gün önce | View offer |
Fiyatlar ve stok durumu değişebilir. Son Güncelleme: 08.08.2026 23:09.
0,0
☆☆☆☆☆
0 reviews
5★
0%
4★
0%
3★
0%
2★
0%
1★
0%
Product reviews
No reviews yet — be the first!
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.
Similar products
Patient Safety Coaching
from $91.97
Ethnography and Diversity
from $69.30
Smart Villages
from $91.97
Nuclear Non-Proliferation in International Law - Volume VI
from $91.97
The Price of Freedom
from $91.97
Eco-Social Policy in the OECD and the World Bank
from $91.97
Special Topics in Policing
from $122.58
Music from the Heart
from $91.97