Pages that link to "Item:Q3359973"
From MaRDI portal
The following pages link to Some Recent Advances in Network Flows (Q3359973):
Displaying 17 items.
- Modeling demand management strategies for evacuations (Q490182) (← links)
- Network flows and non-guillotine cutting patterns (Q795062) (← links)
- New algorithms for generalized network flows (Q1332311) (← links)
- Sequential and parallel algorithms for minimum flows. (Q1880468) (← links)
- Algorithms for dense graphs and networks on the random access computer (Q1918989) (← links)
- Problems of synthesis of connected networks with respect to isomorphic subgraphs (Q2574245) (← links)
- (Q3057916) (← links)
- (Q3129189) (← links)
- (Q3682209) (← links)
- CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL (Q4337491) (← links)
- (Q4420181) (← links)
- Algorithm for Searching an Equilibrium in a Routing Game with Piecewise Constant Cost Functions (Q4557738) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
- Some recent contributions to network optimization (Q4812397) (← links)
- The problem of synthesis of reliable networks (Q5951291) (← links)
- The invisible‐hand heuristic for origin‐destination integer multicommodity network flows (Q6065841) (← links)
- An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems (Q6087567) (← links)