Pages that link to "Item:Q927190"

The following pages link to An efficient generalized network-simplex-based algorithm for manufacturing network flows (Q927190):

Displaying 9 items.

• A specialized network simplex algorithm for the constrained maximum flow problem (Q531424) (← links)
• A note on a generalized network flow model for manufacturing process (Q1036893) (← links)
• A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks (Q1758062) (← links)
• A network simplex algorithm for simple manufacturing network model (Q1780135) (← links)
• Maximum flows in generalized processing networks (Q2012883) (← links)
• A polynomial local optimality condition for the concave piecewise linear network flow problem (Q2146593) (← links)
• A novel approach to subgraph selection with multiple weights on arcs (Q2168723) (← links)
• Some further results on minimum distribution cost flow problems (Q2479563) (← links)
• Manufacturing network flows: a generalized network flow model for manufacturing process modelling (Q3046538) (← links)