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)

7 174,00 JPY

Typical price492,59 PLN

Lowest (90 days)35,99 PLN

Offers6

Last updated1 सप्ताह पहले

See best offer

Price history (90 days)

Full history

2026-08-08 2026-08-15

मूल्य इतिहास
अपडेट किया गया	कीमत
2026-08-08	39,99
2026-08-14	35,99
2026-08-15	51,99

विक्रेता	Product price	Delivery	कुल	उपलब्धता	Updated
SP SpringerNatureLink Shop INT	7 149,00 JPY	25,00 JPY	7 174,00 JPY	उपलब्ध	2 दिन पहले	View offer
SP Springer Nature Author	7 149,00 JPY	free	7 149,00 JPY	उपलब्ध	1 सप्ताह पहले	View offer
SP SpringerNatureLink Shop INT	49,99 USD	29,00 USD	78,99 USD	उपलब्ध	2 दिन पहले	View offer
SP SpringerNatureLink Shop INT	54,99 USD	free	54,99 USD	उपलब्ध	2 दिन पहले	View offer
SP SpringerNatureLink Shop INT	54,99 USD	19,00 USD	73,99 USD	उपलब्ध	2 दिन पहले	View offer
SP SpringerNatureLink Shop INT	59,00 EUR	25,00 EUR	84,00 EUR	उपलब्ध	2 दिन पहले	View offer

कीमतें और उपलब्धता बदल सकती हैं। अंतिम अपडेट: 08.08.2026 23:09.

0,0

☆☆☆☆☆

0 reviews

5★ 0%

4★ 0%

3★ 0%

2★ 0%

1★ 0%

Product reviews

Name

Rating

Your review

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.