Pages that link to "Item:Q3703618"
From MaRDI portal
The following pages link to A minimum concave-cost dynamic network flow problem with an application to lot-sizing (Q3703618):
Displaying 11 items.
- The minimal average cost flow problem (Q1130071) (← links)
- Capacity optimization and competition with cyclical and lead-time-dependent demands (Q1730571) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- An approximation algorithm for a general class of multi-parametric optimization problems (Q2082173) (← links)
- An approximation algorithm for a general class of parametric optimization problems (Q2156299) (← links)
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
- On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems (Q2423820) (← links)
- On the computational complexity of minimum-concave-cost flow in a two-dimensional grid (Q2828332) (← links)
- TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in <i>O</i>(<i>n</i> log <i>n</i>) Time (Q3392169) (← links)
- Minimum Convex Cost Dynamic Network Flows (Q3685538) (← links)
- Send-and-Split Method for Minimum-Concave-Cost Network Flows (Q3820348) (← links)
