|
|
|
|
| LEADER |
03076nam a22005295i 4500 |
| 001 |
978-3-540-30717-4 |
| 003 |
DE-He213 |
| 005 |
20151204173548.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2007 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540307174
|9 978-3-540-30717-4
|
| 024 |
7 |
|
|a 10.1007/978-3-540-30717-4
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA402.5-402.6
|
| 072 |
|
7 |
|a PBU
|2 bicssc
|
| 072 |
|
7 |
|a MAT003000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 519.6
|2 23
|
| 100 |
1 |
|
|a Matoušek, Jiří.
|e author.
|
| 245 |
1 |
0 |
|a Understanding and Using Linear Programming
|h [electronic resource] /
|c by Jiří Matoušek, Bernd Gärtner.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2007.
|
| 300 |
|
|
|a VIII, 226 p. 62 illus.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Universitext
|
| 505 |
0 |
|
|a What Is It, and What For? -- Examples -- Integer Programming and LP Relaxation -- Theory of Linear Programming: First Steps -- The Simplex Method -- Duality of Linear Programming -- Not Only the Simplex Method -- More Applications -- Software and Further Reading.
|
| 520 |
|
|
|a This is an introductory textbook of linear programming, written mainly for students of computer science and mathematics. Our guiding phrase is, “what everytheoreticalcomputerscientistshouldknowaboutlinearprogramming.” The book is relatively concise, in order to allow the reader to focus on the basic ideas. For a number of topics commonly appearing in thicker books on the subject, we were seriously tempted to add them to the main text, but we decided to present them only very brie?y in a separate glossary. At the same time, we aim at covering the main results with complete proofs and in su?cient detail, in a way ready for presentation in class. One of the main focuses is applications of linear programming, both in practice and in theory. Linear programming has become an extremely ?- ible tool in theoretical computer science and in mathematics. While many of the ?nest modern applications are much too complicated to be included in an introductory text, we hope to communicate some of the ?avor (and excitement) of such applications on simpler examples.
|
| 650 |
|
0 |
|a Mathematics.
|
| 650 |
|
0 |
|a Operations research.
|
| 650 |
|
0 |
|a Decision making.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Mathematical optimization.
|
| 650 |
|
0 |
|a Management science.
|
| 650 |
1 |
4 |
|a Mathematics.
|
| 650 |
2 |
4 |
|a Optimization.
|
| 650 |
2 |
4 |
|a Operations Research, Management Science.
|
| 650 |
2 |
4 |
|a Mathematics of Computing.
|
| 650 |
2 |
4 |
|a Operation Research/Decision Theory.
|
| 700 |
1 |
|
|a Gärtner, Bernd.
|e author.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540306979
|
| 830 |
|
0 |
|a Universitext
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-540-30717-4
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SMA
|
| 950 |
|
|
|a Mathematics and Statistics (Springer-11649)
|
