Pages that link to "Item:Q1591357"
From MaRDI portal
The following pages link to An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems (Q1591357):
Displayed 7 items.
- Implementation and test of auction methods for solving generalized network flow problems with separable convex cost (Q1810926) (← links)
- Convex generalized flows (Q2352786) (← links)
- A decomposition approach for the general lotsizing and scheduling problem for parallel production lines (Q2355899) (← links)
- Maximum network flows with concave gains (Q2492702) (← links)
- A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints (Q2802141) (← links)
- (Q5743452) (← links)
- A simple GAP-canceling algorithm for the generalized maximum flow problem (Q5901710) (← links)