The following pages link to Clyde l. Monma (Q582078):
Displayed 46 items.
- On the complexity of embedding planar graphs to minimize certain distance measures (Q582079) (← links)
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- Item:Q582078 (redirect page) (← links)
- Subtree and substar intersection numbers (Q686262) (← links)
- Tolerance graphs (Q798675) (← links)
- Computing Euclidean maximum spanning trees (Q911288) (← links)
- Intersection graphs of paths in a tree (Q1077439) (← links)
- Computational experience with a dual affine variant of Karmarkar's method for linear programming (Q1092808) (← links)
- Item:Q582078 (redirect page) (← links)
- Sequencing with general precedence constraints (Q1142151) (← links)
- Item:Q582078 (redirect page) (← links)
- Transitions in geometric minimum spanning trees (Q1199130) (← links)
- NETPAD: An interactive graphics system for network modeling and optimization (Q1904615) (← links)
- On perfect graphs and polyhedra with (0, 1)-valued extreme points (Q3208440) (← links)
- (Q3322150) (← links)
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints (Q3352817) (← links)
- On the Structure of Minimum-Weight <i>k</i>-Connected Spanning Networks (Q3490035) (← links)
- A concise survey of efficiently solvable special cases of the permutation flow-shop problem (Q3674391) (← links)
- (Q3689221) (← links)
- Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions (Q3760291) (← links)
- (Q3789612) (← links)
- On the Complexity of Covering Vertices by Faces in a Planar Graph (Q3790663) (← links)
- Threshold tolerance graphs (Q3797238) (← links)
- Send-and-Split Method for Minimum-Concave-Cost Network Flows (Q3820348) (← links)
- Optimal enclosing regions in planar graphs (Q3832585) (← links)
- The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions (Q3853421) (← links)
- Sequencing to Minimize the Maximum Job Cost (Q3857701) (← links)
- (Q3869068) (← links)
- (Q3869069) (← links)
- Multigram codes (Corresp.) (Q3869252) (← links)
- Sequencing with Series-Parallel Precedence Constraints (Q3879034) (← links)
- Linear-Time Algorithms for Scheduling on Parallel Processors (Q3939587) (← links)
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints (Q4004739) (← links)
- Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints (Q4018839) (← links)
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming (Q4019974) (← links)
- Further Development of a Primal-Dual Interior Point Method (Q4025908) (← links)
- (Q4035361) (← links)
- (Q4197628) (← links)
- (Q4197629) (← links)
- On the Complexity of Scheduling with Batch Setup Times (Q4205231) (← links)
- Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times (Q4286476) (← links)
- (Q4731197) (← links)
- (Q4845372) (← links)
- (Q4873762) (← links)
- Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements (Q4887724) (← links)
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions (Q5749161) (← links)