Pricelists.org ログイン新規登録

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 149,00 JPY

Typical price314,07 PLN

Lowest (90 days)39,99 PLN

Offers2

Last updated13時間前

See best offer

販売者	Product price	Delivery	合計	在庫状況	Updated
SP Springer Nature Author	7 149,00 JPY	free	7 149,00 JPY	在庫あり	12時間前	View offer
SP SpringerNatureLink Shop INT	59,00 EUR	25,00 EUR	84,00 EUR	在庫あり	1日前	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.