Pages that link to "Item:Q4145180"

The following pages link to Using shortest paths in some transshipment problems with concave costs (Q4145180):

Displaying 2 items.

• A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (Q1341992) (← links)
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)