東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

A First Course in Combinatorial Opti...

Lee, Jon.

FindBook

Google Book

Amazon

博客來

A First Course in Combinatorial Optimization.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	A First Course in Combinatorial Optimization./
作者:	Lee, Jon.
其他作者:	Ablowitz, M. J.
出版者:	Cambridge :Cambridge University Press, : 2004.,
面頁冊數:	229 p.
內容註:	Cover; Half-title; Title; Copyright; Contents; Preface; Introduction; 0 Polytopes and Linear Programming; 1 Matroids and the Greedy Algorithm; 2 Minimum-Weight Dipaths; 3 Matroid Intersection; 4 Matching; 5 Flows and Cuts; 6 Cutting Planes; 7 Branch-&-Bound; 8 Optimizing Submodular Functions; Appendix: Notation and Terminology; References; Indexes
標題:	Combinatorial optimization. -
電子資源:	http://dx.doi.org/10.1017/CBO9780511616655Click here to view book
ISBN:	9780511616655 (electronic bk.)

A First Course in Combinatorial Optimization.
Lee, Jon.

A First Course in Combinatorial Optimization.[electronic resource]. - Cambridge :Cambridge University Press,2004. - 229 p.

Cover; Half-title; Title; Copyright; Contents; Preface; Introduction; 0 Polytopes and Linear Programming; 1 Matroids and the Greedy Algorithm; 2 Minimum-Weight Dipaths; 3 Matroid Intersection; 4 Matching; 5 Flows and Cuts; 6 Cutting Planes; 7 Branch-&-Bound; 8 Optimizing Submodular Functions; Appendix: Notation and Terminology; References; Indexes

This text for a one-semester introductory graduate course for students of operations research, mathematics, and computer science covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. The author focuses on the key mathematical ideas that lead to useful models and algorithms.

Electronic reproduction.

Available via World Wide Web.

Mode of access: World Wide Web.

ISBN: 9780511616655 (electronic bk.)Subjects--Topical Terms:

544215
Combinatorial optimization.
Index Terms--Genre/Form:

542853
Electronic books.

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

Dewey Class. No.: 519.3

A First Course in Combinatorial Optimization.
LDR:01570nmm a22002893u 4500 001 1809067
003 AU-PeEL
005 20090601202837.0
006 m d
007 cr mn---------
008 231221t2004 ||| s |||||||eng|d
020 $a 9780511616655 (electronic bk.)
020 $a 9780521811514 (print)
035 $a EBL256498
035 $a EBL256498
035 $a 1809067
040 $a AU-PeEL $c AU-PeEL $d AU-PeEL
050 0 0 $a QA402.5 .L394 2004eb
082 0 0 $a 519.3
100 1 $a Lee, Jon. $3 644215
245 1 2 $a A First Course in Combinatorial Optimization. $h [electronic resource].
260 $a Cambridge : $b Cambridge University Press, $c 2004.
300 $a 229 p.
505 0 $a Cover; Half-title; Title; Copyright; Contents; Preface; Introduction; 0 Polytopes and Linear Programming; 1 Matroids and the Greedy Algorithm; 2 Minimum-Weight Dipaths; 3 Matroid Intersection; 4 Matching; 5 Flows and Cuts; 6 Cutting Planes; 7 Branch-&-Bound; 8 Optimizing Submodular Functions; Appendix: Notation and Terminology; References; Indexes
520 $a This text for a one-semester introductory graduate course for students of operations research, mathematics, and computer science covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. The author focuses on the key mathematical ideas that lead to useful models and algorithms.
533 $a Electronic reproduction. $n Available via World Wide Web.
538 $a Mode of access: World Wide Web.
650 4 $a Combinatorial optimization. $3 544215
655 7 $a Electronic books. $2 lcsh $3 542853
700 1 $a Ablowitz, M. J. $3 1898456
700 1 $a Davis, S. H. $3 1898457
700 1 $a Hinch, E. J. $3 1898458
700 1 $a Iserles, A. $3 579711
700 1 $a Ockendon, J. $3 1898459
700 1 $a Olver, P. J. $3 1898460
710 2 $a Ebooks Corporation. $3 1314793
776 1 $z 9780521811514
856 4 0 $z Click here to view book $u http://dx.doi.org/10.1017/CBO9780511616655