A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
☆☆☆☆☆
(0 reviews)
Lowest price (incl. delivery)
39,99 USD
Typical price175,03 PLN
Lowest (90 days)35,99 PLN
Offers4
Last updatedför 5 dagar sedan
Price history (90 days)
Full history
2026-08-08
2026-08-14
| Uppdaterad | Pris |
|---|---|
| 2026-08-08 | 39,99 |
| 2026-08-14 | 35,99 |
| Säljare | Product price | Delivery | Totalt | Tillgänglighet | Updated | |
|---|---|---|---|---|---|---|
| SP SpringerNatureLink Shop INT | 39,99 USD | free | 39,99 USD | Tillgänglig | för 3 minuter sedan | View offer |
| SP SpringerNatureLink Shop INT | 39,99 USD | 19,00 USD | 58,99 USD | Tillgänglig | för 3 minuter sedan | View offer |
| SP SpringerNatureLink Shop INT | 35,99 GBP | 25,00 GBP | 60,99 GBP | Tillgänglig | för 21 minuter sedan | View offer |
| SP Springer Nature Author | 7 149,00 JPY | free | 7 149,00 JPY | Tillgänglig | för 5 dagar sedan | View offer |
Priser och tillgänglighet kan ändras. Senast uppdaterad: 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.