Pricelists.org Pricelists.org Log in Sign up

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization

☆☆☆☆☆ (0 reviews)
Show price history
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Lowest price (incl. delivery)
39,99 USD
Typical price178,38 PLN
Lowest (90 days)35,99 PLN
Offers6
Last updated6 days ago
See best offer
Price history (90 days)
Full history
2026-08-08 2026-08-14
Price History
Updated AtPrice
2026-08-0839,99
2026-08-1435,99
Seller Product price Delivery Total Availability Updated
SP SpringerNatureLink Shop INT 39,99 USD free 39,99 USD Available 50 minutes ago View offer
SP SpringerNatureLink Shop INT 39,99 USD 19,00 USD 58,99 USD Available 50 minutes ago View offer
SP SpringerNatureLink Shop INT 42,79 USD 29,00 USD 71,79 USD Available 29 minutes ago View offer
SP SpringerNatureLink Shop INT 42,79 USD 25,00 USD 67,79 USD Available 29 minutes ago View offer
SP Springer Nature Author 7 149,00 JPY free 7 149,00 JPY Available 6 days ago View offer
SP SpringerNatureLink Shop INT 47,00 EUR 25,00 EUR 72,00 EUR Available 9 minutes ago View offer

Prices and availability may change. Last Updated: 08.08.2026 23:09.

0,0
☆☆☆☆☆
0 reviews
5★ 0%
4★ 0%
3★ 0%
2★ 0%
1★ 0%

Product reviews

Rating
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