| Record ID | marc_columbia/Columbia-extract-20221130-010.mrc:336281750:3524 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-010.mrc:336281750:3524?format=raw |
LEADER: 03524cam a22003614a 4500
001 4828296
005 20221103043854.0
008 040604t20042004maua b 001 0 eng
010 $a 2004053846
020 $a1402080980 (HB)
020 $a1402080999 (E-book)
035 $a(OCoLC)ocm55633780
035 $a(NNC)4828296
035 $a4828296
040 $aDLC$cDLC$dC#P$dOHX$dOrLoB-B
042 $apcc
050 00 $aQA402.5$b.J584 2004
072 7 $aQA$2lcco
082 00 $a519.6$222
100 1 $aJongen, H. Th.$q(Hubertus Th.),$d1947-$0http://id.loc.gov/authorities/names/n84166479
245 10 $aOptimization theory /$cby Hubertus Th. Jongen, Klaus Meer, Eberhard Triesch.
260 $aBoston :$bKluwer Academic Publishers,$c[2004], ©2004.
300 $axi, 443 pages :$billustrations ;$c25 cm
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
504 $aIncludes bibliographical references (p. [427]-443) and indexes.
505 00 $gI.$tContinuous optimization -- $g1.$tOptimality criteria on simple regions -- $g2.$tConstraints, Lagrange function, optimality -- $g3.$tParametric aspects, semi-infinite optimization -- $g4.$tConvex functions, duality, separation theorem -- $g5.$tLinear inequalities, constraint qualifications -- $g6.$tLinear programming : the simplex method -- $g7.$tThe ellipsoid method -- $g8.$tKarmarkar's method for linear programming -- $g9.$tOrder of convergence, steepest descent -- $g10.$tConjugate direction, variable metric -- $g11.$tPenalty-, barrier-, multiplier-, IP-methods -- $g12.$tSearch methods without derivatives -- $g13.$tOne-dimensional minimization -- $gII.$tDiscrete optimization -- $g14.$tGraphs and networks -- $g15.$tFlows in networks -- $g16.$tApplications of the max-flow min-cut theorem -- $g17.$tInteger linear programming -- $g18.$tComputability; the Turing machine -- $g19.$tComplexity theory -- $g20.$tReducibility and NP-completeness -- $g21.$tSome NP-completeness results -- $g22.$tThe random access machine -- $g23.$tComplexity theory over the real numbers -- $g24.$tApproximating NP-hard problems -- $g25.$tApproximation algorithms for TSP -- $g26.$tApproximation algorithms for bin packing -- $g27.$tA FPTAS for knapsack -- $g28.$tMiscellaneous.
520 1 $a"Optimization Theory is becoming a more and more important mathematical as well as interdisciplinary area, especially in the interplay between mathematics and many other sciences like computer science, physics, engineering, operations research, etc." "This volume gives a comprehensive introduction into the theory of (deterministic) optimization on an advanced undergraduate and graduate level." "One main feature is the treatment of both continuous and discrete optimization at the same place. This allows the study of the problems from different points of view, supporting a better understanding of the entire field." "Audience: The book can be adapted well as an introductory textbook into optimization theory on a basis of a two semester course: however, each of its parts can also be taught separately. Many exercise are included to increase the readers' understanding."--BOOK JACKET.
650 0 $aMathematical optimization.$0http://id.loc.gov/authorities/subjects/sh85082127
650 0 $aMaxima and minima.$0http://id.loc.gov/authorities/subjects/sh85082365
700 1 $aMeer, Klaus.$0http://id.loc.gov/authorities/names/n2004009347
700 1 $aTriesch, Eberhard.$0http://id.loc.gov/authorities/names/n2004009323
852 00 $boff,eng$hQA402.5$i.J584 2004