A O(nm) Heuristic to the Hierarchical Maximum Concurrent Flow Problem
AIAA Information Systems-AIAA Infotech @ Aerospace
2017-01-01
Conference paper
Electronic Resource
English
A O(nm) Heuristic to the Hierarchical Maximum Concurrent Flow Problem (AIAA 2017-0880)
British Library Conference Proceedings | 2017
|Graph Coarsening for Runtime Improvements in the Maximum Concurrent Flow Problem (AIAA 2018-0468)
British Library Conference Proceedings | 2018
|Ring hierarchical hub network design problem: Exact and heuristic solution methods
DOAJ | 2022
|Bottleneck Focused Heuristic Algorithm for Hybrid Flow Shop Scheduling Problem
British Library Online Contents | 2012
|