語系:
繁體中文
English
說明(常見問題)
回圖書館
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
A First Course in Combinatorial Opti...
~
Lee, Jon.
A First Course in Combinatorial Optimization.
紀錄類型:
書目-電子資源 : 單行本
正題名/作者:
A First Course in Combinatorial Optimization./
作者:
Lee, Jon.
其他作者:
Ablowitz, M. J.
出版者:
Cambridge :Cambridge University Press, : 2004.,
面頁冊數:
229 p.
標題:
Combinatorial optimization. -
電子資源:
Click 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:
121537
Combinatorial optimization.
Index Terms--Genre/Form:
96803
Electronic books.
LC Class. No.: QA402.5 .L394 2004eb
Dewey Class. No.: 519.3
A First Course in Combinatorial Optimization.
LDR
:01562nmm a22002773u 4500
001
148374
003
AU-PeEL
005
20090601202837.0
006
m d
007
cr mn---------
008
160127t2004 ||| s |||||||eng|d
020
$a
9780511616655 (electronic bk.)
020
$a
9780521811514 (print)
035
$a
EBL256498
035
$a
EBL256498
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
242714
245
1 2
$a
A First Course in Combinatorial Optimization.
$h
[electronic resource].
260
$a
Cambridge :
$c
2004.
$b
Cambridge University Press,
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
121537
655
7
$a
Electronic books.
$2
local.
$3
96803
700
1
$a
Ablowitz, M. J.
$3
276727
700
1
$a
Davis, S. H.
$3
276728
700
1
$a
Hinch, E. J.
$3
276729
700
1
$a
Iserles, A.
$3
276730
700
1
$a
Ockendon, J.
$3
276731
700
1
$a
Olver, P. J.
$3
276732
710
2
$a
Ebooks Corporation.
$3
197505
776
1
$z
9780521811514
856
4 0
$z
Click here to view book
$u
http://ebooks.cambridge.org/ebook.jsf?bid=CBO9780511616655
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼
登入