Clyde L. Monma

Publication Activity (10 Years)

Years Active: 1979-1995
Publications (10 Years): 0

Publications

Martin Grötschel, Clyde L. Monma, Mechthild Stoer
Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements. Oper. Res. 43 (6) (1995)
Nathaniel Dean, Monika Mevenkamp, Clyde L. Monma
NETPAD: An interactive graphics system for network modeling and optimization. Oper. Res. Lett. 17 (2) (1995)
Yi-Wu Chang, Michael S. Jacobson, Clyde L. Monma, Douglas B. West
Subtree and Substar Intersection Numbers. Discret. Appl. Math. 44 (1-3) (1993)
Clyde L. Monma, Chris N. Potts
Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times. Oper. Res. 41 (5) (1993)
Clyde L. Monma, Subhash Suri
Transitions in Geometric Minimum Spanning Trees. Discret. Comput. Geom. 8 (1992)
Martin Grötschel, Clyde L. Monma, Mechthild Stoer
Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints. SIAM J. Optim. 2 (3) (1992)
Martin Grötschel, Clyde L. Monma, Mechthild Stoer
Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints. Oper. Res. 40 (2) (1992)
Clyde L. Monma, Subhash Suri
Transitions in Geometric Minimum Spanning Trees (Extended Abstract). SCG (1991)
Daniel Bienstock, Clyde L. Monma
On the Complexity of Embedding Planar Graphs To Minimize Certain Distance Measures. Algorithmica 5 (1) (1990)
Clyde L. Monma, Alexander Schrijver, Michael J. Todd, Victor K.-W. Wei
Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions. Math. Oper. Res. 15 (4) (1990)
In Chan Choi, Clyde L. Monma, David F. Shanno
Further Development of a Primal-Dual Interior Point Method. INFORMS J. Comput. 2 (4) (1990)
Daniel Bienstock, Ernest F. Brickell, Clyde L. Monma
-Connected Spanning Networks. SIAM J. Discret. Math. 3 (3) (1990)
Clyde L. Monma, Beth Spellman Munson, William R. Pulleyblank
Minimum-Weight Two-Connected Spanning Networks. Math. Program. 46 (1990)
Martin Grötschel, Clyde L. Monma
Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints. SIAM J. Discret. Math. 3 (4) (1990)
Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao
Computing Euclidean Maximum Spanning Trees. Algorithmica 5 (3) (1990)
Kevin A. McShane, Clyde L. Monma, David F. Shanno
An Implementation of a Primal-Dual Interior Point Method for Linear Programming. INFORMS J. Comput. 1 (2) (1989)
Clyde L. Monma, David F. Shallcross
Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints. Oper. Res. 37 (4) (1989)
Clyde L. Monma, Chris N. Potts
On the Complexity of Scheduling with Batch Setup Times. Oper. Res. 37 (5) (1989)
Richard H. Cardwell, Clyde L. Monma, Tsong-Ho Wu
Computer-aided design procedures for survivable fiber optic networks. IEEE J. Sel. Areas Commun. 7 (8) (1989)
Martin Grötschel, Clyde L. Monma, Mechthild Stoer
Polyhedral Approaches to Network Survivability. Reliability Of Computer And Communication Networks (1989)
Daniel Bienstock, Clyde L. Monma
Optimal enclosing regions in planar graphs. Networks 19 (1) (1989)
Clyde L. Monma, Bruce A. Reed, William T. Trotter
Threshold tolerance graphs. J. Graph Theory 12 (3) (1988)
Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao
Computing Euclidean Maximum Spanning Trees. SCG (1988)
Daniel Bienstock, Clyde L. Monma
On the Complexity of Covering Vertices by Faces in a Planar Graph. SIAM J. Comput. 17 (1) (1988)
Ranel E. Erickson, Clyde L. Monma, Arthur F. Veinott Jr.
Send-and-Split Method for Minimum-Concave-Cost Network Flows. Math. Oper. Res. 12 (4) (1987)
Clyde L. Monma, Jeffrey B. Sidney
Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions. Math. Oper. Res. 12 (1) (1987)
Clyde L. Monma, Diane Sheng
Backbone Network Design and Performance Analysis: A Methodology for Packet Switching Networks. IEEE J. Sel. Areas Commun. 4 (6) (1986)
Clyde L. Monma, Victor K.-W. Wei
Intersection graphs of paths in a tree. J. Comb. Theory, Ser. B 41 (2) (1986)
Martin Charles Golumbic, Clyde L. Monma, William T. Trotter
Tolerance graphs. Discret. Appl. Math. 9 (2) (1984)
Clyde L. Monma, Donald R. Smith
Probabilistic analysis of interframe tie requirements for cross-connect systems. AT&T Bell Lab. Tech. J. 63 (4) (1984)
Edgar N. Gilbert, Clyde L. Monma
Multigram codes. IEEE Trans. Inf. Theory 28 (2) (1982)
Clyde L. Monma
Network flow programming, by P. A. Jensen and J. W. Barnes, John Wiley and Sons, Inc., New York, 1980, 408 pp. Price: $28.95. Networks 12 (3) (1982)
Clyde L. Monma
Linear-Time Algorithms for Scheduling on Parallel Processors. Oper. Res. 30 (1) (1982)
Clyde L. Monma
Operations Research Support Methodology, Albert G. Holzman, Ed., Marcel Dekker, New York, 1979, 648 pp. Price $39.75. Networks 11 (3) (1981)
Clyde L. Monma
Sequencing with general precedence constraints. Discret. Appl. Math. 3 (2) (1981)
Clyde L. Monma
Sequencing to Minimize the Maximum Job Cost. Oper. Res. 28 (4) (1980)
Clyde L. Monma
The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions. Oper. Res. 27 (4) (1979)
Clyde L. Monma, Leslie E. Trotter Jr.
On perfect graphs and polyhedra with (0, 1)-valued extreme points. Math. Program. 17 (1) (1979)
Clyde L. Monma, Jeffrey B. Sidney
Sequencing with Series-Parallel Precedence Constraints. Math. Oper. Res. 4 (3) (1979)