A Subtree-Partitioning Algorithm for Inducing Parallelism in Network Simplex Dual Updates
Computational Optimization and Applications
“The quickest transshipment problem”
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Polynomial time algorithms for some evacuation problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Faster algorithms for the quickest transshipment problem with zero transit times
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Flows over time with load-dependent transit times
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum cost flows over time without intermediate storage
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Universally Maximum Flow with Piecewise-Constant Capacities
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Quickest Multicommodity Flow Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Time-Expanded Graphs for Flow-Dependent Transit Times
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
An O(n log2 n) algorithm for the optimal sink location problem in dynamic tree networks
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Multicommodity flows over time: Efficient algorithms and complexity
Theoretical Computer Science
Flows in dynamic networks with aggregate arc capacities
Information Processing Letters
Meta-heuristic Algorithm for the Transshipment Problem with Fixed Transportation Schedules
IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
The Maximum Energy-Constrained Dynamic Flow Problem
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Traffic Networks and Flows over Time
Algorithmics of Large and Complex Networks
Equilibria in Dynamic Selfish Routing
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Nash Equilibria and the Price of Anarchy for Flows over Time
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Multicommodity flows over time: efficient algorithms and complexity
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Chance constrained maximum flow problem with fuzzy arc capacities
ICIC'06 Proceedings of the 2006 international conference on Intelligent computing: Part II
Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints
Discrete Event Dynamic Systems
Truck dock assignment problem with operational time constraint within crossdocks
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Generalized maximum flows over time
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Lot sizing with inventory gains
Operations Research Letters
Efficient continuous-time dynamic network flow algorithms
Operations Research Letters
Determining the Optimal Flows in Zero-Time Dynamic Networks
Journal of Mathematical Modelling and Algorithms
Problem Decomposition for Evacuation Simulation Using Network Flow
DS-RT '12 Proceedings of the 2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications
Maximum multicommodity flows over time without intermediate storage
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |