close
1.

図書
図書
1. Mathematical programming : proceedings of an advanced seminar conducted by the Mathematics Research Center, the University of Wisconsin, and the U.S. Army at Madison, September 11-13, 1972
edited by T.C. Hu and Stephen M. Robinson
出版情報: New York : Academic Press, 1973  x, 295 p. ; 24 cm
シリーズ名: Publication of the Mathematics Research Center, University of Wisconsin ; no. 30
所蔵情報: loading…
2.

図書
図書
2. Integer programming and network flows
[by] T. C. Hu
出版情報: Reading, Mass. : Addison-Wesley Pub. Co, [1969]  xii, 452 p ; 24 cm
所蔵情報: loading…
3.

図書
図書
3. Combinatorial algorithms
T.C. Hu
出版情報: Reading, MA : Addison-Wesley Pub. Co., c1982  292 p. ; 24 cm
所蔵情報: loading…
目次情報: 続きを見る
Shortest Paths / Chapter 1：
Graph terminology / 1.1：
Shortest path / 1.2：
Multiterminal shortest paths / 1.3：
Decomposition algorithm / 1.4：
Acyclic network / 1.5：
Shortest paths in a general network / 1.6：
Minimum spanning tree / 1.7：
Breadth-first-search and depth-first-search / 1.8：
Maximum flows / Chapter 2：
Maximum flow / 2.1：
Algorithms for max flows / 2.2：
Ford and Fulkerson / 2.2.1：
Karzanov's algorithm / 2.2.2：
MPM algorithms / 2.2.3：
Analysis of algorithms / 2.2.4：
Multi-terminal maximum flows / 2.3：
Realization / 2.3.1：
Analysis / 2.3.2：
Synthesis / 2.3.3：
Multi-commodity flows / 2.3.4：
Minimum cost flows / 2.4：
Applications / 2.5：
Sets of distinct representatives / 2.5.1：
PERT / 2.5.2：
Optimum communication spanning tree / 2.5.3：
Dynamic programming / Chapter 3：
Introduction / 3.1：
Knapsack problem / 3.2：
Two-dimensional knapsack problem / 3.3：
Minimum-cost alphabetic tree / 3.4：
Summary / 3.5：
Backtracking / Chapter 4：
Estimating the efficiency of backtracking / 4.1：
Branch and bound / 4.3：
Game-tree / 4.4：
Binary tree / Chapter 5：
Huffman's tree / 5.1：
Alphabetic tree / 5.3：
Hu-Tucker algorithm / 5.4：
Feasibility and optimality / 5.5：
Garsia and Wachs' algorithm / 5.6：
Regular cost function / 5.7：
T-ary tree and other results / 5.8：
Heuristic and near optimum / Chapter 6：
Greedy algorithm / 6.1：
Bin-packing / 6.2：
Job-scheduling / 6.3：
Job-scheduling (tree-constraints) / 6.4：
Matrix multiplication / Chapter 7：
Strassen's matrix multiplication / 7.1：
Optimum order of multiplying matrices / 7.2：
Partitioning a convex polygon / 7.3：
The heuristic algorithm / 7.4：
NP-complete / Chapter 8：
Polynomial algorithms / 8.1：
Nondeterministic algorithms / 8.3：
NP-complete problems / 8.4：
Facing a new problem / 8.5：
Local indexing algorithms / Chapter 9：
Mergers of algorithms / 9.1：
Maximum flows and minimum cuts / 9.2：
Maximum adjacency and minimum separation / 9.3：
Gomory-Hu tree / Chapter 10：
Tree edges and tree links / 10.1：
Contraction / 10.2：
Domination / 10.3：
Equivalent formulations / 10.4：
Optimum mergers of companies / 10.4.1：
Optimum circle partition / 10.4.2：
Extreme stars and host-feasible circles / 10.5：
The high-level approach / 10.6：
Chop-stick method / 10.7：
Relationship between phases / 10.8：
The staircase diagram / 10.9：
Complexity issues / 10.10：
Comments on Chapters 2, 5 & 6 / Appendix A：
Ancestor trees / A.1：
Minimum surface or plateau problem / A.2：
Comments on binary trees in chapter 5 / A.3：
A simple proof of the Hu-Tucker algorithm / A.3.1：
Binary search trees / A.3.2：
Binary search on a tape / A.3.3：
Comments on §6.2, bin-packing / A.4：
Network algebra / Appendix B：
Shortest Paths / Chapter 1：
Graph terminology / 1.1：
Shortest path / 1.2：
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼