E-LIB Suche - Ergebnisse für: Monma, Clyde L

1

Handbook in operations research and management science

volume on "Networks" ; chapter on "Design of survivable net... Preprint / Konrad-Zuse-Zentrum für Informationstechnik Berlin ; SC 93,9

Grötschel, Martin ; Monma, Clyde L. ; Stoer, Mechthild - [Electronic ed.] . , ca.1998

Link: http://edok01.tib.uni-ha..

2

NETPAD: An interactive graphics system for network modeling..:

Dean, Nathaniel ; Mevenkamp, Monika ; Monma, Clyde L.
Operations Research Letters. 17 (1995) 2 - p. 89-101 , 1995

Link: https://doi.org/10.1016/..

3

Analysis of Heuristics for Preemptive Parallel Machine Sche..:

Monma, Clyde L. ; Potts, Chris N.
Operations Research. 41 (1993) 5 - p. 981-993 , 1993

Link: https://www.jstor.org/st..

4

Subtree and substar intersection numbers:

Chang, Yi-Wu ; Jacobson, Michael S. ; Monma, Clyde L..
Discrete Applied Mathematics. 44 (1993) 1-3 - p. 205-220 , 1993

Link: https://doi.org/10.1016/..

5

Facets for Polyhedra Arising in the Design of Communication..:

Grötschel, Martin ; Monma, Clyde L. ; Stoer, Mechthild
SIAM Journal on Optimization. 2 (1992) 3 - p. 474-504 , 1992

Link: https://doi.org/10.1137/..

6

Computational Results with a Cutting Plane Algorithm for De..:

Grötschel, Martin ; Monma, Clyde L. ; Stoer, Mechthild
Operations Research. 40 (1992) 2 - p. 309-330 , 1992

Link: https://www.jstor.org/st..

7

Transitions in geometric minimum spanning trees:

Monma, Clyde ; Suri, Subhash
Discrete & Computational Geometry. 8 (1992) 3 - p. 265-293 , 1992

Link: https://doi.org/10.1007/..

8

Transitions in geometric minimum spanning trees (extended a..:

, In: Proceedings of the seventh annual symposium on Computational geometry,

Monma, Clyde ; Suri, Subhash - p. 239-249 , 1991

Link: https://dl.acm.org/doi/1..

9

Convex Resource Allocation Problems on Directed Acyclic Gra..:

Monma, Clyde L. ; Schrijver, Alexander ; Todd, Michael J..
Mathematics of Operations Research. 15 (1990) 4 - p. 736-748 , 1990

Link: https://www.jstor.org/st..

10

Minimum-weight two-connected spanning networks:

Monma, Clyde L. ; Munson, Beth Spellman ; Pulleyblank, William R.
Mathematical Programming. 46 (1990) 1-3 - p. 153-171 , 1990

Link: https://doi.org/10.1007/..

11

On the Structure of Minimum-Weight k-Connected Spanning Net..:

Bienstock, Daniel ; Brickell, Ernest F. ; Monma, Clyde L.
SIAM Journal on Discrete Mathematics. 3 (1990) 3 - p. 320-329 , 1990

Link: https://doi.org/10.1137/..

12

Integer Polyhedra Arising from Certain Network Design Probl..:

Grötschel, Martin ; Monma, Clyde L.
SIAM Journal on Discrete Mathematics. 3 (1990) 4 - p. 502-523 , 1990

Link: https://doi.org/10.1137/..

13

Computing euclidean maximum spanning trees:

Monma, Clyde ; Paterson, Michael ; Suri, Subhash.
Algorithmica. 5 (1990) 1-4 - p. 407-419 , 1990

Link: https://doi.org/10.1007/..

14

On the complexity of embedding planar graphs to minimize ce..:

Bienstock, Daniel ; Monma, Clyde L.
Algorithmica. 5 (1990) 1-4 - p. 93-109 , 1990

Link: https://doi.org/10.1007/..

15

Optimal enclosing regions in planar graphs:

Bienstock, Daniel ; Monma, Clyde L.
Networks. 19 (1989) 1 - p. 79-94 , 1989

Link: https://doi.org/10.1002/..