Pages that link to "Item:Q924394"
From MaRDI portal
The following pages link to A fast polynomial time algorithm for logistics network flows (Q924394):
Displaying 6 items.
- A bio-inspired algorithm for identification of critical components in the transportation networks (Q298402) (← links)
- A combinatorial approximation algorithm for supply chain network flow problem (Q884620) (← links)
- The binary network flow problem is logspace complete for P (Q914388) (← links)
- A bi-level programming for logistics network design with system-optimized flows (Q2390364) (← links)
- (Q3081849) (← links)
- A Recursive Algorithm for Order Cycle-time that Minimizes Logistics Cost (Q3818780) (← links)