A Subtree-Partitioning Algorithm for Inducing Parallelism in Network Simplex Dual Updates
Computational Optimization and Applications
Strengthening integrality gaps for capacitated network design and covering problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Computational Optimization and Applications
Journal of Optimization Theory and Applications
An exterior simplex type algorithm for the Minimum Cost Network Flow Problem
Computers and Operations Research
A Hybrid Solution Approach for Ready-Mixed Concrete Delivery
Transportation Science
Improved algorithm for minimum flows in bipartite networks with unit capacities
WSEAS Transactions on Computers
Computers and Industrial Engineering
WSEAS Transactions on Computers
ePERT: extending PERT for workflow management systems
ADBIS'97 Proceedings of the First East-European conference on Advances in Databases and Information systems
Hi-index | 0.00 |
From the Publisher:Unique in that it focuses on formulation and case studies rather than solutions procedures covering applications for pure, generalized and integer networks, equivalent formulations plus successful techniques of network models. Every chapter contains a simple model which is expanded to handle more complicated developments, a synopsis of existing applications, one or more case studies, at least 20 exercises and invaluable references.