Integer programming and network flows
[by] T. C. Hu.

Description

Tools

Cite this Export citation file

Main Author: Hu, T. C. (Te Chiang), 1930-
Language(s): English
Published: Reading, Mass., Addison-Wesley Pub. Co. [1969]
Subjects: Integer programming
Network analysis (Planning)
Linear programming.
Physical Description: xii, 452 p. illus. 24 cm.
Locate a Print Version: Find in a library

Viewability

Item Link	Original Source
Limited (search only)	University of Michigan

View HathiTrust MARC record

Similar Items

Combinatorial algorithms

Author: Hu, T. C. (Te Chiang), 1930-
Published: 1982

The optimal partitioning of networks

Author: Cheng, C. K
Published: 1989

Maximum concurrent flow and minimum ratio cut

Author: Cheng, C. K
Published: 1988

Ancestor tree for multi-terminal cut functions

Author: Cheng, C. K
Published: 1989

Mathematical programming; proceedings of an Advanced Seminar

Author: Advanced Seminar on Mathematical Programming (1972 : Madison, Wis.)
Published: 1973

Anatomy of on-line bin packing

Author: Hu, T. C. (Te Chiang), 1930-
Published: 1988

Generalizing the maximum folding problem

Author: Hu, T. C. (Te Chiang), 1930-
Published: 1991

The checkmate condition and the super-simplex algorithm

Author: Hu, T. C. (Te Chiang), 1930-
Published: 1988

The orientation of modules based on graph decomposition

Author: Cheng, C. K
Published: 1988

Optimization of globally convex functions

Author: Hu, T. C. (Te Chiang), 1930-
Published: 1989