Pages that link to "Item:Q3046538"
From MaRDI portal
The following pages link to Manufacturing network flows: a generalized network flow model for manufacturing process modelling (Q3046538):
Displaying 16 items.
- A specialized network simplex algorithm for the constrained maximum flow problem (Q531424) (← links)
- A manufacturing supply chain optimization model for distilling process (Q814740) (← links)
- An efficient generalized network-simplex-based algorithm for manufacturing network flows (Q927190) (← links)
- A note on a generalized network flow model for manufacturing process (Q1036893) (← links)
- Generating and evaluating process redesign options: A network modeling approach (Q1368374) (← links)
- An aggregation procedure for simulating manufacturing flow line models (Q1374035) (← links)
- An intelligent modeling system for generalized network flow problems: With application to planning for multinational firms (Q1379767) (← 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 novel approach to subgraph selection with multiple weights on arcs (Q2168723) (← links)
- Some further results on minimum distribution cost flow problems (Q2479563) (← links)
- A compaction scheme and generator for distribution networks (Q2515272) (← links)
- A hydrodynamic modelling framework for production networks (Q2655749) (← links)
- (Q3686412) (← links)
- Maximal flow network modelling of production bottleneck problems (Q4658396) (← links)
