menu
{ "item_title" : "Linear and Integer Programming Made Easy", "item_author" : [" T. C. Hu", "Andrew B. Kahng "], "item_description" : "This textbook provides concise coverage of the basics of linear and integer programming which, with megatrends toward optimization, machine learning, big data, etc., are becoming fundamental toolkits for data and information science and technology. The authors' approach is accessible to students from almost all fields of engineering, including operations research, statistics, machine learning, control system design, scheduling, formal verification and computer vision. The presentations enables the basis for numerous approaches to solving hard combinatorial optimization problems through randomization and approximation. Readers will learn to cast various problems that may arise in their research as optimization problems, understand the cases where the optimization problem will be linear, choose appropriate solution methods and interpret results appropriately.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/3/31/923/999/3319239996_b.jpg", "price_data" : { "retail_price" : "64.99", "online_price" : "64.99", "our_price" : "64.99", "club_price" : "64.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Linear and Integer Programming Made Easy|T. C. Hu

Linear and Integer Programming Made Easy

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

This textbook provides concise coverage of the basics of linear and integer programming which, with megatrends toward optimization, machine learning, big data, etc., are becoming fundamental toolkits for data and information science and technology. The authors' approach is accessible to students from almost all fields of engineering, including operations research, statistics, machine learning, control system design, scheduling, formal verification and computer vision. The presentations enables the basis for numerous approaches to solving hard combinatorial optimization problems through randomization and approximation.
Readers will learn to cast various problems that may arise in their research as optimization problems, understand the cases where the optimization problem will be linear, choose appropriate solution methods and interpret results appropriately.

This item is Non-Returnable

Details

  • ISBN-13: 9783319239996
  • ISBN-10: 3319239996
  • Publisher: Springer
  • Publish Date: May 2016
  • Dimensions: 9.21 x 6.14 x 0.44 inches
  • Shipping Weight: 0.88 pounds
  • Page Count: 143

Related Categories

You May Also Like...

    1

BAM Customer Reviews