|
|
|
|
| LEADER |
00000cam a2200000Mi 4500 |
| 001 |
ocn969546804 |
| 003 |
OCoLC |
| 005 |
20240809213013.0 |
| 006 |
m o d |
| 007 |
cr |n||||||||| |
| 008 |
170120s2017 xx ob 001 0 eng d |
| 040 |
|
|
|a YDX
|b eng
|e pn
|c YDX
|d N$T
|d EBLCP
|d OCLCQ
|d N$T
|d OCLCO
|d OCLCF
|d COO
|d WYU
|d CUY
|d ZCU
|d MERUC
|d ICG
|d DKC
|d OCLCQ
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCL
|d SXB
|d OCLCQ
|
| 019 |
|
|
|a 969883410
|
| 020 |
|
|
|a 9781119368540
|q (electronic bk.)
|
| 020 |
|
|
|a 1119368545
|q (electronic bk.)
|
| 020 |
|
|
|a 9781119368526
|q (electronic bk.)
|
| 020 |
|
|
|a 1119368529
|q (electronic bk.)
|
| 020 |
|
|
|a 9781119368519
|q (e-book)
|
| 020 |
|
|
|a 1119368510
|
| 020 |
|
|
|z 1786301067
|
| 020 |
|
|
|z 9781786301062
|
| 035 |
|
|
|a (OCoLC)969546804
|z (OCoLC)969883410
|
| 050 |
|
4 |
|a HD38.5
|
| 072 |
|
7 |
|a BUS
|x 082000
|2 bisacsh
|
| 072 |
|
7 |
|a BUS
|x 041000
|2 bisacsh
|
| 072 |
|
7 |
|a BUS
|x 042000
|2 bisacsh
|
| 072 |
|
7 |
|a BUS
|x 085000
|2 bisacsh
|
| 049 |
|
|
|a HCDD
|
| 100 |
1 |
|
|a REVEILLAC, JEAN-MICHEL.
|
| 245 |
1 |
0 |
|a MODELING AND SIMULATION OF LOGISTICS FLOWS :
|b theory and fundamentals.
|
| 260 |
|
|
|a [Place of publication not identified] :
|b JOHN WILEY,
|c 2017.
|
| 300 |
|
|
|a 1 online resource
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 505 |
0 |
|
|a Cover ; Title Page; Copyright; Contents; Foreword; About This Book; Intended public; Organization and contents of the book; Conventions; Vocabulary and definition; Acknowledgments; Introduction; I.1. What is logistics?; I.2. History; I.3. New tools and new technologies; 1. Operational Research; 1.1. A history; 1.2. Fields of application, principles and concepts; 1.2.1. Identification; 1.2.2. Modeling; 1.2.3. Solution; 1.2.4. Validation; 1.2.5. Implementation; 1.2.6. Improvement; 1.3. Basic models; 1.4. The future of OR; 2. Elements of Graph Theory; 2.1. Graphs and representations.
|
| 505 |
8 |
|
|a 2.2. Undirected graph2.2.1. Multigraph; 2.2.2. Planar and non-planar graph; 2.2.3. Connected and unconnected graph; 2.2.4. Complete graph; 2.2.5. Bipartite graph; 2.2.6. Partial graph, subgraph, clique and stable; 2.2.7. Degree of a vertex and a graph; 2.2.8. Chain and cycle in a graph; 2.2.9. Level of connectivity (or beta index); 2.2.10. Eulerian graph; 2.2.11. Hamiltonian graph; 2.2.12. Planar graph; 2.2.13. Isthmus; 2.2.14. Tree and forest; 2.2.15. Arborescence; 2.2.16. Ordered arborescence; 2.3. Directed graph or digraph; 2.3.1. Path and circuit in a digraph.
|
| 505 |
8 |
|
|a 2.3.2. Absence of circuit in a digraph2.3.3. Adjacency matrix; 2.3.4. Valued graph matrix; 2.4. Graphs for logistics; 3. Optimal Paths; 3.1. Basic concepts; 3.2. Dijkstra's algorithm; 3.2.1. An example of calculating minimal paths; 3.2.2. Interpreting the results of the calculations; 3.3. Floyd-Warshall's algorithm; 3.3.1. Creating the starting matrices (initialization of the algorithm); 3.3.2. Filling the matrices for the following repetitions; 3.3.3. An example of calculating minimal paths; 3.3.4. Interpreting the results; 3.4. Bellman-Ford's algorithm; 3.4.1. Initialization.
|
| 505 |
8 |
|
|a 3.4.2. The next repetitions with relaxation3.4.3. An example of calculation; 3.4.4. Interpreting the results; 3.5. Bellman-Ford's algorithm with a negative circuit; 3.5.1. Example; 3.6. Exercises; 3.6.1. Exercise 1: Optimizing journey time; 3.6.2. Exercise 2: A directed graph with negative cost side; 3.6.3. Exercise 3: Routing data packets; 3.6.4. Solutions to exercise 1; 3.6.5. Solutions to exercise 2; 3.6.6. Solutions to exercise 3; 4. Dynamic Programming; 4.1. The principles of dynamic programming; 4.2. Formulating the problem; 4.2.1. Example 1: The pyramid of numbers.
|
| 505 |
8 |
|
|a 4.2.2. Example 2: The Fibonacci sequence4.2.3. Example 3: The knapsack; 4.3. Stochastic process; 4.4. Markov chains; 4.4.1. Property of Markov chains; 4.4.2. Classes and states of a chain; 4.4.3. Matrix and graph; 4.4.4. Applying Markov chains; 4.5. Exercises; 4.5.1. Exercise 1: Levenshtein distance; 4.5.2. Exercise 2; 4.5.3. Exercise 3: Ehrenfest model; 4.5.4. Solutions to exercise 1; 4.5.5. Solutions to exercise 2; 4.5.6. Solutions to exercise 3; 5. Scheduling with PERT and MPM; 5.1. Fundamental concepts; 5.2. Critical path method; 5.3. Precedence diagram.
|
| 520 |
8 |
|
|a Volume 1 presents successively an introduction followed by 10 chapters and a conclusion:- A logistic approach- an overview of operations research- The basics of graph theory- calculating optimal routes- Dynamic programming- planning and scheduling with PERT and MPM;- the waves of calculations in a network;- spanning trees and touring;- linear programming - modeling of road traffic.
|
| 504 |
|
|
|a Includes bibliographical references and index.
|
| 650 |
|
0 |
|a Business logistics
|x Mathematical models.
|
| 650 |
|
7 |
|a BUSINESS & ECONOMICS
|x Industrial Management.
|2 bisacsh
|
| 650 |
|
7 |
|a BUSINESS & ECONOMICS
|x Management.
|2 bisacsh
|
| 650 |
|
7 |
|a BUSINESS & ECONOMICS
|x Management Science.
|2 bisacsh
|
| 650 |
|
7 |
|a BUSINESS & ECONOMICS
|x Organizational Behavior.
|2 bisacsh
|
| 650 |
|
7 |
|a Business logistics
|x Mathematical models
|2 fast
|
| 758 |
|
|
|i has work:
|a Modeling and simulation of logistics flows Dashboards, traffic planning and management 2 (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCGX4PVRkfVXfvKMmGHkyHP
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
| 776 |
0 |
8 |
|i Print version:
|z 1786301067
|z 9781786301062
|w (OCoLC)966891507
|
| 856 |
4 |
0 |
|u https://ebookcentral.proquest.com/lib/holycrosscollege-ebooks/detail.action?docID=4790375
|y Click for online access
|
| 903 |
|
|
|a EBC-AC
|
| 994 |
|
|
|a 92
|b HCD
|