Pages that link to "Item:Q2494472"
From MaRDI portal
The following pages link to Lower bounds from state space relaxations for concave cost network flow problems (Q2494472):
Displaying 3 items.
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← links)
- A branch-and-bound algorithm for concave network flow problems (Q2494473) (← links)
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
