Description |
1 online resource (x, 143 pages) : illustrations (some color) |
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 on Integer Programs -- Linear and Integer Programming in Practice -- The Branch and Bound Method of Integer Programming.- |
Summary |
Annotation 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 |
Bibliography |
Includes bibliographical references and index |
Notes |
Online resource; title from PDF title page (SpringerLink, viewed May 11, 2016) |
Subject |
Linear programming
|
|
Integer programming.
|
|
Maths for computer scientists.
|
|
Maths for engineers.
|
|
Applied mathematics.
|
|
Circuits & components.
|
|
Computers -- Data Processing.
|
|
Mathematics -- Applied.
|
|
Technology & Engineering -- Electronics -- Circuits -- General.
|
|
Integer programming
|
|
Linear programming
|
Form |
Electronic book
|
Author |
Kahng, Andrew B., 1963- author.
|
ISBN |
9783319240015 |
|
3319240013 |
|