Pages that link to "Item:Q4178779"

The following pages link to A streamlined simplex approach to the singly constrained transportation problem (Q4178779):

Displaying 5 items.

• A specialized network simplex algorithm for the constrained maximum flow problem (Q531424) (← links)
• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm (Q1318275) (← links)
• Dynamic factorization in large-scale optimization (Q1330893) (← links)
• A network simplex method for the budget-constrained minimum cost flow problem (Q1751898) (← links)
• The singly constrained assignment problem: An AP basis algorithm (Q1908532) (← links)