| Tag |
First Indicator |
Second Indicator |
Subfields |
| LEADER |
00000cam a2200000Ki 4500 |
| 001 |
in00003548784 |
| 006 |
m o d |
| 007 |
cr cnu---unuuu |
| 008 |
140711s2002 gw a ob 001 0 eng d |
| 005 |
20260422201800.6 |
| 020 |
|
|
|a 9783662217115 (electronic bk.)
|
| 020 |
|
|
|a 3662217112 (electronic bk.)
|
| 020 |
|
|
|z 3540431543
|
| 020 |
|
|
|z 9783540431541
|
| 024 |
7 |
|
|a 10.1007/978-3-662-21711-5
|2 doi
|
| 035 |
|
|
|a (OCoLC)883381853
|
| 040 |
|
|
|a GW5XE
|b eng
|e rda
|e pn
|c GW5XE
|d UtOrBLW
|
| 049 |
|
|
|a TXAM
|
| 050 |
|
4 |
|a QA402.5
|b .K6665 2002eb
|
| 082 |
0 |
4 |
|a 519.3
|2 22
|
| 084 |
|
|
|a 31.12
|2 bcl
|
| 100 |
1 |
|
|a Korte, B. H.
|q (Bernhard H.),
|d 1938-
|
| 245 |
1 |
0 |
|a Combinatorial optimization :
|b theory and algorithms /
|c Bernhard Korte, Jens Vygen.
|
| 250 |
|
|
|a Second edition.
|
| 264 |
|
1 |
|a Berlin ;
|a New York :
|b Springer,
|c [2002]
|
| 264 |
|
4 |
|c ©2002
|
| 300 |
|
|
|a 1 online resource (xiii, 530 pages) :
|b illustrations.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Algorithms and combinatorics,
|x 0937-5511 ;
|v 21
|
| 504 |
|
|
|a Includes bibliographical references and indexes.
|
| 505 |
0 |
|
|a Graphs -- Linear programming -- Linear programming algorithms -- Integer programming -- Spanning trees and arborescences -- Shortest paths -- Network flows -- Minimum cost flows -- Maximum matchings -- Weighted matching -- B-matchings and T-joins -- Matroids -- Generalizations of matroids -- NP-completeness -- Approximation algorithms -- The knapsack problem -- Bin-packing -- Multicommodity flows and edge-disjoint paths -- Network design problems -- The traveling salesman problem.
|
| 520 |
1 |
|
|a "This textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. Since the complete book contains enough material for at least four semesters (4 hours a week), one usually selects material in a suitable way. The book contains complete (but concise) proofs, also for many deep results, some of which did not appear in a book before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state-of-the-art of combinatorial optimization. For the second edition several corrections and many updates have been made in the text."--BOOK JACKET.
|
| 588 |
|
|
|a Description based on print version record.
|
| 650 |
|
0 |
|a Combinatorial optimization.
|
| 650 |
|
4 |
|a Optimización combinatoria.
|
| 650 |
1 |
7 |
|a Optimaliseren.
|2 gtt
|
| 650 |
1 |
7 |
|a Combinatieleer.
|2 gtt
|
| 650 |
1 |
7 |
|a Mathematische programmering.
|2 gtt
|
| 650 |
1 |
7 |
|a Algoritmen.
|2 gtt
|
| 650 |
|
7 |
|a Combinatorial optimization.
|2 fast
|0 (OCoLC)fst00868980
|
| 655 |
|
7 |
|a Electronic books.
|2 local
|
| 700 |
1 |
|
|a Vygen, Jens.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 776 |
1 |
8 |
|i Print version:
|a Korte, B. H. (Bernhard H.), 1938-
|t Combinatorial optimization.
|b Second edition
|z 3540431543
|w (DLC) 2002017038
|w (OCoLC)49798314
|
| 830 |
|
0 |
|a Algorithms and combinatorics ;
|v 21.
|x 0937-5511
|
| 856 |
4 |
0 |
|u http://proxy.library.tamu.edu/login?url=https://link.springer.com/10.1007/978-3-662-21711-5
|z Connect to the full text of this electronic book
|t 0
|
| 994 |
|
|
|a 92
|b TXA
|
| 999 |
|
|
|a MARS
|
| 999 |
f |
f |
|s 31cc6175-ddcb-3ce1-bf97-6d964112ee1b
|i b25432dd-58b5-3f32-b6f2-49bcbdaca161
|t 0
|
| 952 |
f |
f |
|a Texas A&M University
|b College Station
|c Electronic Resources
|s www_evans
|d Available Online
|t 0
|e QA402.5 .K6665 2002eb
|h Library of Congress classification
|
| 998 |
f |
f |
|a QA402.5 .K6665 2002eb
|t 0
|l Available Online
|