XWe have detected your location as outside the U.S/Canada, if you think this is wrong, you can choose your location.

Macmillan Higher Education Celebrating 20 years of Macmillan Study Skills

Cart

Continue Shopping
All prices are shown excluding Tax
The submitted promocode is invalid
Discount code already used. It can only be used once.
* Applied promocode: ×

Important information on your ebook order

Linear and Integer Programming Made Easy

Author(s):
Publisher:

Springer

Pages: 143
Further Actions:

Recommend to library

AVAILABLE FORMATS

Paperback - 9783319795683

26 May 2018

$69.99

In stock

Hardcover - 9783319239996

13 May 2016

$69.99

Free Shipping

In stock

Ebook - 9783319240015

03 May 2016

$54.99

In stock

All prices are shown excluding Tax

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

Show More

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.

Show Less

Provides a concise introduction to linear and integer programming, appropriate for undergraduates, graduates, a short course or book camp, or self-learning;

Targets not only computer scientists and engineers, but those in management science and operations research as well;

Emphasizes basics and intuitive concepts, and gives corresponding numerical examples;

Includes exercises to test and reinforce the concepts introduced, along with a website containing additional material matched to the book's contents.

Preliminaries
Introduction.- Dimension of the Solution Space.- Introduction to the Simplex Method.- Duality and Complementary Slackness.- Revised Simplex Method.- Column Generating Technique.- The Knapsack Problem.- Asymptotic Algorithms.- The World Map of Integer Programs.- Linear and Integer Programming in Practice
Add a review

T.C. Hu received his B.S. in Engineering from the National Taiwan University in 1953, M.S. in Engineering from the University of Illinois in 1956, and Ph.D in applied Mathematics from Brown University in 1960. From 1960 to 1966, he was with the IBM Research Center. Dr. Hu was appointed Associate Professor in the Dept. of Computer Science at the University of Wisconsin in 1966 and Full Professor in 1968 (also permanent member of the Mathematics Research Center). In 1974, Dr. Hu was appointed Professor (Step IV) in the Department of Applied Physics and Information Science at the University of California, San Diego, and was promoted to Professor (Step VIII) in 1989. His research contributions can be classified...

Show More

T.C. Hu received his B.S. in Engineering from the National Taiwan University in 1953, M.S. in Engineering from the University of Illinois in 1956, and Ph.D in applied Mathematics from Brown University in 1960. From 1960 to 1966, he was with the IBM Research Center. Dr. Hu was appointed Associate Professor in the Dept. of Computer Science at the University of Wisconsin in 1966 and Full Professor in 1968 (also permanent member of the Mathematics Research Center). In 1974, Dr. Hu was appointed Professor (Step IV) in the Department of Applied Physics and Information Science at the University of California, San Diego, and was promoted to Professor (Step VIII) in 1989. His research contributions can be classified into six areas: (I) Network Flows and Integer Programming; (II) Combinatorial Algorithms; (III) Math Computing; (IV) VLSI Physical Design; (V) Operations Research; and (VI) Plasticity.


Andrew B. Kahng (b. Oct. 1963, San Diego, CA) received the A.B. degree in applied mathematics (physics) from Harvard College, and from June 1983 to June 1986 was affiliated with Burroughs Corporation Micro Components Group in San Diego, where he worked in device physics, circuit simulation, and CAD for VLSI layout. He received the M.S. and Ph.D degrees in computer science from the University of California at San Diego. He joined the UCLA computer science department as an assistant professor in July 1989, and became associate professor in July 1994 and full professor (at age 34) in July 1998. In October 2004, Professor Kahng co-founded Blaze DFM, Inc., an EDA software company that delivered new cost and yield optimizations at the IC design-manufacturing interface. He served as CTO of the company during a two-year leave of absence, returning to the university full-time in September 2006. Professor Kahng has served on the editorial boards of IEEE Transactions on VLSI, IEEE Transactions on Circuits and Systems I, IEEE Design and Test (where he contributes the regular column, "The Road Ahead"), and the Research Highlights section of the Communications of the ACM. He has been a member of the executive committee of the MARCO Gigascale Systems Research Center since the center's inception in 1998.

Show Less

New Publications 

Best Sellers