國立虎尾科技大學 |

A first course in combinatorial optimization /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	A first course in combinatorial optimization // Jon Lee.
作者:	Lee, Jon,
面頁冊數:	1 online resource (xvi, 211 pages) :digital, PDF file(s). :
附註:	Title from publisher's bibliographic system (viewed on 05 Oct 2015).
標題:	Combinatorial optimization. -
電子資源:	https://doi.org/10.1017/CBO9780511616655
ISBN:	9780511616655 (ebook)

A first course in combinatorial optimization /
Lee, Jon,1960-

A first course in combinatorial optimization /Jon Lee. - 1 online resource (xvi, 211 pages) :digital, PDF file(s). - Cambridge texts in applied mathematics ;36. - Cambridge texts in applied mathematics ;50..

Title from publisher's bibliographic system (viewed on 05 Oct 2015).

A First Course in Combinatorial Optimization is a 2004 text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.

ISBN: 9780511616655 (ebook)Subjects--Topical Terms:

528128
Combinatorial optimization.

LC Class. No.: QA402.5 / .L394 2004

Dewey Class. No.: 519.6/4

A first course in combinatorial optimization /
LDR:01924nam a2200301 i 4500 001 1124414
003 UkCbUP
005 20151005020621.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 240926s2004||||enk o ||1 0|eng|d
020 $a 9780511616655 (ebook)
020 $z 9780521811514 (hardback)
020 $z 9780521010122 (paperback)
035 $a CR9780511616655
040 $a UkCbUP $b eng $e rda $c UkCbUP
050 0 0 $a QA402.5 $b .L394 2004
082 0 0 $a 519.6/4 $2 22
100 1 $a Lee, Jon, $d 1960- $e author. $3 1441928
245 1 2 $a A first course in combinatorial optimization / $c Jon Lee.
264 1 $a Cambridge : $b Cambridge University Press, $c 2004.
300 $a 1 online resource (xvi, 211 pages) : $b digital, PDF file(s).
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 Cambridge texts in applied mathematics ; $v 36
500 $a Title from publisher's bibliographic system (viewed on 05 Oct 2015).
520 $a A First Course in Combinatorial Optimization is a 2004 text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.
650 0 $a Combinatorial optimization. $3 528128
776 0 8 $i Print version: $z 9780521811514
830 0 $a Cambridge texts in applied mathematics ; $v 50. $3 1238310
856 4 0 $u https://doi.org/10.1017/CBO9780511616655