The following pages link to (Q3138913):
Displaying 6 items.
- The generalized assignment problem with minimum quantities (Q257215) (← links)
- Polynomial dual network simplex algorithms (Q689130) (← links)
- A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← links)
- A new dual based procedure for the transportation problem (Q1577109) (← links)
- Obtaining a good primal solution to the uncapacitated transportation problem (Q1869409) (← links)
- (Q4488857) (← links)
