Optimization of globally convex functions /
T.C. Hu, Victor Klee, and David Larman

Description

Tools

Cite this Export citation file

Main Author: Hu, T. C. (Te Chiang), 1930-
Related Names: Larman, David
Klee, Victor
University of California, San Diego. Department of Computer Science and Engineering
Language(s): English
Published: La Jolla, Calif. : Dept. of Computer Science and Engineering, University of California, San Diego, [1989]
Note: "February 1989."
Physical Description: 29 pages : illustrations ; 28 cm
Locate a Print Version: Find in a library

Viewability

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

View HathiTrust MARC record

Similar Items

Ancestor tree for multi-terminal cut functions

Author: Cheng, C. K
Published: 1989

The optimal partitioning of networks

Author: Cheng, C. K
Published: 1989

Maximum concurrent flow and minimum ratio cut

Author: Cheng, C. K
Published: 1988

The orientation of modules based on graph decomposition

Author: Cheng, C. K
Published: 1988

Generalizing the maximum folding problem

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

Anatomy of on-line bin packing

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

The checkmate condition and the super-simplex algorithm

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

Combinatorial algorithms

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

Integer programming and network flows

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

Partitioning with spacefilling curves

Author: Pilkington, John R
Published: 1994