×
Author ID: hu.te-chiang Recent zbMATH articles by "Hu, Te-Chiang"
Published as: Hu, Te Chiang; Hu, Te-Chiang; Hu, T. C.

Publications by Year

Citations contained in zbMATH Open

58 Publications have been cited 8 times in 8 Documents Cited by Year
Multi-terminal networks flows. Zbl 0112.12405
Gomory, R. E.; Hu, T. C.
202
1961
Integer programming and network flows. Zbl 0197.45701
Hu, T. C.
164
1969
Multi-commodity network flows. Zbl 0123.23704
Hu, T. C.
85
1963
Optimal linear ordering. Zbl 0274.90061
Adolphson, D.; Hu, T. C.
66
1973
Optimum communication spanning trees. Zbl 0269.90010
Hu, T. C.
55
1974
Optimal computer search trees and variable-length alphabetical codes. Zbl 0228.94002
Hu, T. C.; Tucker, A. C.
44
1971
Generating binary trees lexicographically. Zbl 0366.68027
Ruskey, F.; Hu, T. C.
33
1977
Combinatorial algorithms. Zbl 0505.68022
Hu, T. C.
29
1982
On complete convergence for arrays of row-wise negatively associated random variables. Zbl 1146.60025
Chen, P.; Hu, T.-C.; Liu, X.; Volodin, A.
28
2008
Optimization of globally convex functions. Zbl 0686.52006
Hu, T. C.; Klee, Victor; Larman, David
24
1989
An application of generalized linear programming to network flows. Zbl 0105.12805
Gomory, R. E.; Hu, T. C.
18
1962
Assignment of tasks in a distributed processor system with limited memory. Zbl 0397.68024
Rao, Gururaj S.; Stone, Harold S.; Hu, T. C.
14
1979
Synthesis of a communication network. Zbl 0222.94003
Gomory, R. E.; Hu, T. C.
13
1964
Limiting behaviour of moving average processes under negative association assumption. Zbl 1199.60074
Chen, P.; Hu, T.-C.; Volodin, A.
12
2007
Binary trees optimum under various criteria. Zbl 0412.68055
Hu, T. C.; Kleitman, Daniel J.; Tamaki, Jeanne K.
12
1979
Variable location and scale kernel density estimation. Zbl 0818.62039
Jones, M. C.; McKay, I. J.; Hu, T.-C.
11
1994
Shortest string containing all permutations. Zbl 0296.05004
Koutas, P. J.; Hu, T. C.
11
1975
On the rate of complete convergence for weighted sums of arrays of Banach space valued random elements. Zbl 1035.60004
Hu, T.-C.; Li, D.; Rosalsky, A.; Volodin, A. I.
10
2002
A decomposition algorithm for shortest paths in a network. Zbl 0155.28802
Hu, T. C.
10
1968
Ancestor tree for arbitrary multi-terminal cut functions. Zbl 0741.90079
Cheng, C. K.; Hu, T. C.
9
1991
Computation of matrix chain products. I. Zbl 0483.68041
Hu, T. C.; Shing, M. T.
9
1982
Old bachelor acceptance: A new class of non-monotone threshold accepting methods. Zbl 0843.90099
Hu, T. C.; Kahng, Andrew B.; Tsao, Chung-Wen Albert
8
1995
Computation of matrix chain products. II. Zbl 0542.68028
Hu, T. C.; Shing, M. T.
8
1984
A new proof of the T-C algorithm. Zbl 0255.94008
Hu, T. C.
7
1973
Revised matrix algorithms for shortest paths. Zbl 0158.15404
Hu, T. C.
7
1967
Graph folding and programmable logic array. Zbl 0649.05038
Hu, T. C.; Kuo, Y. S.
7
1987
Optimality of a heuristic solution for a class of knapsack problems. Zbl 0353.90056
Hu, T. C.; Lenard, M. L.
7
1976
Path length of binary search trees. Zbl 0239.94009
Hu, T. C.; Tan, K. C.
6
1972
Two-commodity cut-packing problem. Zbl 0255.90067
Hu, T. C.
6
1973
Some optimum algorithms for scheduling problems with changeover costs. Zbl 0621.90038
Hu, T. C.; Kuo, Y. S.; Ruskey, F.
6
1987
Error bounds and the applicability of the greedy solution to the coin- changing problem. Zbl 0372.90093
Tien, B. N.; Hu, T. C.
6
1977
Combinatorial algorithms. 2nd enlarged ed. Zbl 1005.68109
Hu, T. C.; Shing, M. T.
5
2002
A decomposition algorithm for circuit routing. Zbl 0584.90057
Hu, T. C.; Shing, M. T.
5
1985
Shortcut in the decomposition algorithm for shortest paths in a network. Zbl 0194.50801
Hu, T. C.; Torres, W. T.
5
1969
On the asymptotic integer algorithm. Zbl 0196.22704
Hu, T. C.
5
1970
Integer programming and network flows. (Целочисленное программирование и потоки в сетях. Translated from the English by P. L. Buzytskii, E. V. Levner, B. G. Litvak. Edited by A. A. Fridman.) Zbl 0294.90052
Hu, T. C.
5
1974
Binary search on a tape. Zbl 0654.68075
Hu, T. C.; Wachs, Michelle L.
5
1987
A note on the rate of complete convergence for weighted sums of arrays of Banach space valued random elements. Zbl 1058.60006
Volodin, A.; Antonini, Giuliano R.; Hu, T.-C.
4
2004
Minimum volume design of discs. Zbl 0104.40903
Hu, Te-Chiang; Shield, Richard Thorpe
4
1961
Circular cuts in a network. Zbl 0442.90092
Hu, T. C.; Ruskey, F.
4
1980
Maximum concurrent flows and minimum cuts. Zbl 0762.90024
Cheng, C. K.; Hu, T. C.
3
1992
Triangulations (tilings) and certain block triangular matrices. Zbl 0571.90098
Dantzig, G. B.; Hoffman, A. J.; Hu, T. C.
3
1985
Uniqueness in the optimum design of structures. Zbl 0100.21005
Hu, T. C.; Shield, R. T.
3
1961
Generating permutations with nondistinct items. Zbl 0351.05001
Hu, T. C.; Tien, B. N.
3
1976
Optimal integer alphabetic trees in linear time. Zbl 1162.68407
Hu, T. C.; Larmore, Lawrence L.; Morgenthaler, J. David
3
2005
An O(n) algorithm to find a near-optimum partition of a convex polygon. Zbl 0459.68036
Hu, T. C.; Shing, M. T.
3
1981
The orientation of modules based on graph decomposition. Zbl 1395.68012
Cheng, C. K.; Yao, S. Z.; Hu, T. C.
2
1991
A note on the strong laws of large numbers for random variables. Zbl 1399.60043
Hu, T.-C.; Sung, S. H.; Volodin, A.
2
2016
The unbounded knapsack problem. Zbl 1359.90120
Hu, T. C.; Landa, Leo; Shing, Man-Tak
2
2009
On the rate of convergence of bootstrapped means in a Banach space. Zbl 0984.60016
Ejaz Ahmed, S.; Hu, T.-C.; Volodin, Andrei I.
2
2001
Optimum binary search trees. Zbl 0212.23302
Hu, T. C.; Tucker, A. C.
2
1970
Least upper bound on the cost of optimum binary search trees. Zbl 0233.68011
Hu, T. C.; Tan, K. C.
2
1972
Multi-terminal flows in a network. Zbl 0341.90057
Gomory, R. E.; Hu, T. C.
2
1975
Linear and integer programming made easy. Zbl 1336.90001
Hu, T. C.; Kahng, Andrew B.
1
2016
Laplace’s equation and network flows. Zbl 0207.50902
Hu, T. C.
1
1967
Ganzzahlige Programmierung und Netzwerkflüsse. Das amerikanische Original übersetzten Hans Paul Künzi, Edith Roth und Götz Uebe. Zbl 0268.90043
Hu, Te Chiang
1
1972
Optimal alphabetic trees for binary search. Zbl 1339.68061
Hu, T. C.; Tucker, P. A.
1
1998
A decomposition algorithm for multi-terminal network flows. Zbl 0606.90046
Shing, M. T.; Hu, T. C.
1
1986
A note on the strong laws of large numbers for random variables. Zbl 1399.60043
Hu, T.-C.; Sung, S. H.; Volodin, A.
2
2016
Linear and integer programming made easy. Zbl 1336.90001
Hu, T. C.; Kahng, Andrew B.
1
2016
The unbounded knapsack problem. Zbl 1359.90120
Hu, T. C.; Landa, Leo; Shing, Man-Tak
2
2009
On complete convergence for arrays of row-wise negatively associated random variables. Zbl 1146.60025
Chen, P.; Hu, T.-C.; Liu, X.; Volodin, A.
28
2008
Limiting behaviour of moving average processes under negative association assumption. Zbl 1199.60074
Chen, P.; Hu, T.-C.; Volodin, A.
12
2007
Optimal integer alphabetic trees in linear time. Zbl 1162.68407
Hu, T. C.; Larmore, Lawrence L.; Morgenthaler, J. David
3
2005
A note on the rate of complete convergence for weighted sums of arrays of Banach space valued random elements. Zbl 1058.60006
Volodin, A.; Antonini, Giuliano R.; Hu, T.-C.
4
2004
On the rate of complete convergence for weighted sums of arrays of Banach space valued random elements. Zbl 1035.60004
Hu, T.-C.; Li, D.; Rosalsky, A.; Volodin, A. I.
10
2002
Combinatorial algorithms. 2nd enlarged ed. Zbl 1005.68109
Hu, T. C.; Shing, M. T.
5
2002
On the rate of convergence of bootstrapped means in a Banach space. Zbl 0984.60016
Ejaz Ahmed, S.; Hu, T.-C.; Volodin, Andrei I.
2
2001
Optimal alphabetic trees for binary search. Zbl 1339.68061
Hu, T. C.; Tucker, P. A.
1
1998
Old bachelor acceptance: A new class of non-monotone threshold accepting methods. Zbl 0843.90099
Hu, T. C.; Kahng, Andrew B.; Tsao, Chung-Wen Albert
8
1995
Variable location and scale kernel density estimation. Zbl 0818.62039
Jones, M. C.; McKay, I. J.; Hu, T.-C.
11
1994
Maximum concurrent flows and minimum cuts. Zbl 0762.90024
Cheng, C. K.; Hu, T. C.
3
1992
Ancestor tree for arbitrary multi-terminal cut functions. Zbl 0741.90079
Cheng, C. K.; Hu, T. C.
9
1991
The orientation of modules based on graph decomposition. Zbl 1395.68012
Cheng, C. K.; Yao, S. Z.; Hu, T. C.
2
1991
Optimization of globally convex functions. Zbl 0686.52006
Hu, T. C.; Klee, Victor; Larman, David
24
1989
Graph folding and programmable logic array. Zbl 0649.05038
Hu, T. C.; Kuo, Y. S.
7
1987
Some optimum algorithms for scheduling problems with changeover costs. Zbl 0621.90038
Hu, T. C.; Kuo, Y. S.; Ruskey, F.
6
1987
Binary search on a tape. Zbl 0654.68075
Hu, T. C.; Wachs, Michelle L.
5
1987
A decomposition algorithm for multi-terminal network flows. Zbl 0606.90046
Shing, M. T.; Hu, T. C.
1
1986
A decomposition algorithm for circuit routing. Zbl 0584.90057
Hu, T. C.; Shing, M. T.
5
1985
Triangulations (tilings) and certain block triangular matrices. Zbl 0571.90098
Dantzig, G. B.; Hoffman, A. J.; Hu, T. C.
3
1985
Computation of matrix chain products. II. Zbl 0542.68028
Hu, T. C.; Shing, M. T.
8
1984
Combinatorial algorithms. Zbl 0505.68022
Hu, T. C.
29
1982
Computation of matrix chain products. I. Zbl 0483.68041
Hu, T. C.; Shing, M. T.
9
1982
An O(n) algorithm to find a near-optimum partition of a convex polygon. Zbl 0459.68036
Hu, T. C.; Shing, M. T.
3
1981
Circular cuts in a network. Zbl 0442.90092
Hu, T. C.; Ruskey, F.
4
1980
Assignment of tasks in a distributed processor system with limited memory. Zbl 0397.68024
Rao, Gururaj S.; Stone, Harold S.; Hu, T. C.
14
1979
Binary trees optimum under various criteria. Zbl 0412.68055
Hu, T. C.; Kleitman, Daniel J.; Tamaki, Jeanne K.
12
1979
Generating binary trees lexicographically. Zbl 0366.68027
Ruskey, F.; Hu, T. C.
33
1977
Error bounds and the applicability of the greedy solution to the coin- changing problem. Zbl 0372.90093
Tien, B. N.; Hu, T. C.
6
1977
Optimality of a heuristic solution for a class of knapsack problems. Zbl 0353.90056
Hu, T. C.; Lenard, M. L.
7
1976
Generating permutations with nondistinct items. Zbl 0351.05001
Hu, T. C.; Tien, B. N.
3
1976
Shortest string containing all permutations. Zbl 0296.05004
Koutas, P. J.; Hu, T. C.
11
1975
Multi-terminal flows in a network. Zbl 0341.90057
Gomory, R. E.; Hu, T. C.
2
1975
Optimum communication spanning trees. Zbl 0269.90010
Hu, T. C.
55
1974
Integer programming and network flows. (Целочисленное программирование и потоки в сетях. Translated from the English by P. L. Buzytskii, E. V. Levner, B. G. Litvak. Edited by A. A. Fridman.) Zbl 0294.90052
Hu, T. C.
5
1974
Optimal linear ordering. Zbl 0274.90061
Adolphson, D.; Hu, T. C.
66
1973
A new proof of the T-C algorithm. Zbl 0255.94008
Hu, T. C.
7
1973
Two-commodity cut-packing problem. Zbl 0255.90067
Hu, T. C.
6
1973
Path length of binary search trees. Zbl 0239.94009
Hu, T. C.; Tan, K. C.
6
1972
Least upper bound on the cost of optimum binary search trees. Zbl 0233.68011
Hu, T. C.; Tan, K. C.
2
1972
Ganzzahlige Programmierung und Netzwerkflüsse. Das amerikanische Original übersetzten Hans Paul Künzi, Edith Roth und Götz Uebe. Zbl 0268.90043
Hu, Te Chiang
1
1972
Optimal computer search trees and variable-length alphabetical codes. Zbl 0228.94002
Hu, T. C.; Tucker, A. C.
44
1971
On the asymptotic integer algorithm. Zbl 0196.22704
Hu, T. C.
5
1970
Optimum binary search trees. Zbl 0212.23302
Hu, T. C.; Tucker, A. C.
2
1970
Integer programming and network flows. Zbl 0197.45701
Hu, T. C.
164
1969
Shortcut in the decomposition algorithm for shortest paths in a network. Zbl 0194.50801
Hu, T. C.; Torres, W. T.
5
1969
A decomposition algorithm for shortest paths in a network. Zbl 0155.28802
Hu, T. C.
10
1968
Revised matrix algorithms for shortest paths. Zbl 0158.15404
Hu, T. C.
7
1967
Laplace’s equation and network flows. Zbl 0207.50902
Hu, T. C.
1
1967
Synthesis of a communication network. Zbl 0222.94003
Gomory, R. E.; Hu, T. C.
13
1964
Multi-commodity network flows. Zbl 0123.23704
Hu, T. C.
85
1963
An application of generalized linear programming to network flows. Zbl 0105.12805
Gomory, R. E.; Hu, T. C.
18
1962
Multi-terminal networks flows. Zbl 0112.12405
Gomory, R. E.; Hu, T. C.
202
1961
Minimum volume design of discs. Zbl 0104.40903
Hu, Te-Chiang; Shield, Richard Thorpe
4
1961
Uniqueness in the optimum design of structures. Zbl 0100.21005
Hu, T. C.; Shield, R. T.
3
1961

Citations by Year