Pages that link to "Item:Q1751898"

The following pages link to A network simplex method for the budget-constrained minimum cost flow problem (Q1751898):

Displaying 2 items.

• A polynomial local optimality condition for the concave piecewise linear network flow problem (Q2146593) (← links)
• On the complexity and approximability of budget-constrained minimum cost flows (Q2361495) (← links)