The following pages link to D. R. Fulkerson (Q773067):
Displayed 50 items.
- Zero-one matrices with zero trace (Q773068) (← links)
- Blocking pairs of polyhedra arising from network flows (Q1221561) (← links)
- Incidence matrices and interval graphs (Q2395457) (← links)
- Anti-blocking polyhedra (Q2549326) (← links)
- A Network Flow Computation for Project Cost Curves (Q2769012) (← links)
- A Suggested Computation for Maximal Multi-Commodity Network Flows (Q2778592) (← links)
- Increasing the Capacity of a Network: The Parametric Budget Problem (Q2778616) (← links)
- (Q3057916) (← links)
- Note on Dilworth's Decomposition Theorem for Partially Ordered Sets (Q3234598) (← links)
- (Q3236245) (← links)
- (Q3236250) (← links)
- Maximal Flow Through a Network (Q3237973) (← links)
- Network Flow and Systems of Representatives (Q3247127) (← links)
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem (Q3260928) (← links)
- Widths and Heights of (0,1) -Matrices (Q3276703) (← links)
- Traces, Term Ranks, Widths and Heights (Q3278347) (← links)
- A Network-Flow Feasibility Theorem and Combinatorial Applications (Q3278679) (← links)
- Multiplicities and Minimal Widths for (0, 1)-Matrices (Q3288109) (← links)
- (Q3292914) (← links)
- Solution of a Large-Scale Traveling-Salesman Problem (Q3565230) (← links)
- An Algorithm for Scaling Matrices (Q3843908) (← links)
- An Out-of-Kilter Method for Minimal-Cost Flow Problems (Q3849455) (← links)
- (Q4088546) (← links)
- On edge-disjoint branchings (Q4113865) (← links)
- (Q4121713) (← links)
- (Q4124603) (← links)
- (Q4133404) (← links)
- Maximizing the minimum source-sink path subject to a budget constraint (Q4143044) (← links)
- Packing rooted directed cuts in a weighted directed graph (Q4769069) (← links)
- (Q4777322) (← links)
- Expected Critical Path Lengths in PERT Networks (Q5328568) (← links)
- Incidence matrices with the consecutive 1’s property (Q5331785) (← links)
- Some Properties of Graphs with Multiple Edges (Q5341587) (← links)
- Constructing Maximal Dynamic Flows from Static Flows (Q5378808) (← links)
- On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem (Q5378843) (← links)
- Upsets in Round Robin Tournaments (Q5507531) (← links)
- (Q5514188) (← links)
- Transversals and matroid partition (Q5516086) (← links)
- (Q5519729) (← links)
- Flow Networks and Combinatorial Operations Research (Q5555419) (← links)
- (Q5572841) (← links)
- (Q5574558) (← links)
- Flows in infinite graphs (Q5577696) (← links)
- (Q5604409) (← links)
- (Q5609153) (← links)
- (Q5619837) (← links)
- (Q5620998) (← links)
- Bottleneck extrema (Q5622201) (← links)
- Minimal k‐arc connected graphs (Q5629662) (← links)
- (Q5636666) (← links)