Pages that link to "Item:Q1362513"

The following pages link to Equivalence of the primal and dual simplex algorithms for the maximum flow problem (Q1362513):

Displaying 2 items.

• On the transformation mechanism for formulating a multiproduct two-layer supply chain network design problem as a network flow model (Q1718489) (← links)
• An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems (Q6087567) (← links)