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 updated16시간 전

See best offer

판매자	Product price	Delivery	합계	재고 여부	Updated
SP Springer Nature Author	7 149,00 JPY	free	7 149,00 JPY	구매 가능	16시간 전	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.