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

Name: A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Brand: Springer Nature
SKU: 9783658291495
Availability: InStock

Best Price (Coupon Required):
Buy A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization for $36.00 at @ Link.springer.com when you apply the 10% OFF coupon at checkout.
Click “Get Coupon & Buy” to copy the code and unlock the deal.

Set a price drop alert to never miss an offer.

1 Offer Price Range: $39.99 - $39.99

BEST PRICE

Single Product Purchase

$36.00

@ Link.springer.com with extra coupon

Price Comparison

Seller	Contact Seller	List Price	On Sale	Shipping	Best Promo	Final Price	Volume Discount	Financing	Availability	Seller's Page
BEST PRICE 1 Product Purchase @ Link.springer.com		$39.99	$39.99		10% OFF This deals requires coupon	$36.00		See Site	In stock	Visit Store

Product Details

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9783658291495

Condition

New

Product Description

Stefan Rocktschel 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.

Available Colors

N/A

Available Sizes

N/A