Algorithms, graphs, and computers
β Bellman R., Cooke K.L., Lockett J.A.
π Library
π
1970
π Academic Press
π English
β¦ LIBER β¦
π
Algorithms Graphs and Computers
β Scribed by Richard Bellman, Kenneth L. Cooke and Jo Ann Lockett (Eds.)
- Publisher
- Academic Press, Elsevier
- Year
- 1970
- Leaves
- 251
- Series
- Mathematics in Science and Engineering 62
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
β¦ Table of Contents
Content:
Edited by
Page iii
Copyright Page
Page iv
Preface
Pages v-ix
R. Bellman, K.L. Cooke, Jo Ann Lockett
Chapter One: Commuting and Computing
Pages 1-48
Chapter Two: The Method of Successive Approximations
Pages 49-100
Chapter Three: From Chicago to the Grand Canyon by Car and Computer: Difficulties Associated With Large Maps
Pages 101-122
Chapter Four: Proof of the Validity of the Method
Pages 123-141
Chapter Five: Juggling Jugs
Pages 142-173
Chapter Six: The Sawyer Graph and the Billiard Ball Computer
Pages 174-195
Chapter Seven: Cannibals and Missionaries
Pages 196-212
Chapter Eight: The βTravelling Salesmanβ and Other Scheduling Problems
Pages 213-237
Author Index
Pages 239-241
Subject Index
Pages 243-246
π SIMILAR VOLUMES
Algorithms, graphs, and computers
β Bellman R., Cooke K.L., Lockett J.A.
π Library
π
1970
π AP
π English
Graphs, Networks and Algorithms (Algorit
β Dieter Jungnickel
π Library
π
2007
π Springer
π English
This is the definitive guide to graph algorithms. Every algorithm is well documented with proofs and complexity estimates. A general knowledge of graph theory is presupposed. This is a very good thing, since then neither paper or time needs to be vasted on elementaries. There are heaps of introd
Graphs, Networks and Algorithms (Algorit
β Dieter Jungnickel
π Library
π
2007
π Springer
π English
This is the definitive guide to graph algorithms. Every algorithm is well documented with proofs and complexity estimates. A general knowledge of graph theory is presupposed. This is a very good thing, since then neither paper or time needs to be vasted on elementaries. There are heaps of introd
Graphs, Networks and Algorithms (Algorit
β Dieter Jungnickel
π Library
π
2007
π Springer
π English
Revised throughout Includes new chapters on the network simplex algorithm and a section on the five color theorem Recent developments are discussed
Algorithms, Graphs, and Computers, Vol.
β Richard Bellman, Kenneth L. Cooke
π Library
π
1970
π Academic Press
π English