The following pages link to Ivan T. Frisch (Q1211058):
Displaying 15 items.
- Degree realization of undirected graphs in reduced form (Q1211059) (← links)
- Optimization of communication nets with switching (Q2539617) (← links)
- Flow variation in multiple min-cut calculations (Q2541619) (← links)
- The early days ofNetworks (Q2709884) (← links)
- Mathematical programming applied to load flow calculations (Q4766196) (← links)
- (Q4766894) (← links)
- (Q4777320) (← links)
- Letter to the Editor—Common Terminal Multicommodity Flow (Q5538324) (← links)
- On the 3-Commodity Flow Problem (Q5558803) (← links)
- (Q5571469) (← links)
- An Algorithm for Vertex-pair Connectivity (Q5578826) (← links)
- Vertex Weighted Trees with Fewest Relay Vertices (Q5595087) (← links)
- Common Terminal Multicommodity Flow with a Concave Objective Function (Q5620467) (← links)
- A constrained maximum flow problem† (Q5633808) (← links)
- On the fixed cost flow problem† (Q5655205) (← links)