Modeling and Simulation of Logistics Flows 1: Theory and Fundamentals, Volume 1Volume 1 presents successively an introduction followed by 10 chapters and a conclusion:

What people are saying  Write a review
We haven't found any reviews in the usual places.
Contents
Operational Research  1 
Elements of Graph Theory  9 
Optimal Paths  27 
Dynamic Programming  51 
Scheduling with PERT and MPM  73 
Maximum Flow in a Network  137 
Trees Tours and Transport  163 
Other editions  View all
Modeling and Simulation of Logistics Flows: Theory and fundamentals JeanMichel Reveillac No preview available  2017 
Common terms and phrases
algorithm AnyLogic application arc with minimum arches augmenting chain augmenting path branch and bound child node complex connected constraints cost create critical path critical tasks defined determine digraph dual dynamic programming earliest date editor’s website equal example ExtendSim False fictive task Figure FlexSim flow simulation free slack function GB SD cards GeoGebra graph G graph theory graphic halfplane inequation Initialization intersection iteration kinematic waves latest dates linear programming linked logistics loop macroscopic marked Markov chain mathematician matrix maximum flow mesoscopic method Microsoft Excel Microsoft Windows minimum weight MPM graph number of edges number of vertices operational research optimal PERT graph pivot possible predecessor primal problem production project management represents route scheduling SD cards simplex software programs Solutions to exercise speed spreadsheet Step straight line Total slack transportation types variables vertex Vissim