Pages that link to "Item:Q4385161"
From MaRDI portal
The following pages link to Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem (Q4385161):
Displaying 10 items.
- Shortest path and maximum flow problems in networks with additive losses and gains (Q620954) (← links)
- Improving time bounds on maximum generalised flow computations by contracting the network (Q1884873) (← links)
- A new scaling algorithm for the minimum cost network flow problem (Q1970413) (← links)
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738) (← links)
- Maximum network flows with concave gains (Q2492702) (← links)
- A Strongly Polynomial Algorithm for Generalized Flow Maximization (Q2976148) (← links)
- Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains (Q5321689) (← links)
- A simple GAP-canceling algorithm for the generalized maximum flow problem (Q5901710) (← links)
- A polynomial dual simplex algorithm fot the generalized circulation problem. (Q5957566) (← links)
- Generalized maximum flow over time with intermediate storage (Q6546986) (← links)