Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Clyde L. Monma
Information about the author Clyde L. Monma will soon be added to the site.
Found
7 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
NETPAD: An interactive graphics system for network modeling and optimization
1995
The practical and theoretical importance of network models and algorithms is clearly...
Analysis of heuristics for preemptive parallel machine scheduling with batch setup times
1993
The problem of preemptively scheduling N jobs on M identical parallel machines to...
Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints
1992
The authors describe a cutting plane approach to the problem of designing survivable...
Convex resource allocation problems on directed acyclic graphs: Duality, complexity, special cases, and extensions
1990
Consider the following resource allocation problem on a directed acyclic graph (the...
Minimum-weight two-connected spanning networks
1990
The authors consider the problem of constructing a minimum-weight, two-connected...
On the complexity of scheduling with batch setup times
1989
Many practical scheduling problems involve processing several batches of related jobs...
Methods for designing communications networks with certain two-connected survivability constraints
1989
In this paper, the authors consider the problem of designing a minimum cost...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers