Data Correcting Approaches in Combinatorial Optimization

Name: Data Correcting Approaches in Combinatorial Optimization
Brand: Springer Nature
SKU: 9781461452850
Availability: InStock

Best Price (Coupon Required):
Buy Data Correcting Approaches in Combinatorial Optimization for $31.50 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: $34.99 - $34.99

BEST PRICE

Single Product Purchase

$31.50

@ 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		$34.99	$34.99		10% OFF This deals requires coupon	$31.50		See Site	In stock	Visit Store

Product Details

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9781461452850

Condition

New

Product Description

Data Correcting Approaches in Combinatorial Optimization focuses on algorithmic applications of thewell known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems. Researches, students and engineers will benefit from new bounds and branching rules in development efficient branch-and-bound type computational algorithms. This book examines applications for solving the Traveling Salesman Problem and its variations, Maximum Weight Independent Set Problem, Different Classes of Allocation and Cluster Analysis as well as some classes of Scheduling Problems. Data Correcting Algorithms in Combinatorial Optimization introduces the data correcting approach to algorithms which provide an answer to the following questions: how to construct a bound to the original intractable problem and findwhich element of the corrected instance one should branch such that the total size of search tree will be minimized. The PC time needed for solving intractable problems will be adjusted with the requirements for solving real world problems.

Available Colors

N/A

Available Sizes

N/A