Algorithms, Graphs, and Computers ( Volume 62 )

Publication series ：Volume 62

Author： Bellman  

Publisher： Elsevier Science‎

Publication year： 1970

E-ISBN: 9780080955728

P-ISBN(Paperback): 9780120848409

P-ISBN(Hardback):  9780120848409

Subject： TP301.6 algorithm theory

Language： ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Description

Algorithms, Graphs, and Computers

Chapter

Front Cover

pp.：  1 – 4

Algorithms Graphs and Computers

pp.：  4 – 5

Copyright Page

pp.：  5 – 12

Preface

pp.：  6 – 18

Contents

pp.：  12 – 6

Chapter One. COMMUTING AND COMPUTING

pp.：  18 – 66

Chapter Two. THE METHOD OF SUCCESSIVE APPROXIMATIONS

pp.：  66 – 118

Chapter Three. FROM CHICAGO TO THE GRAND CANYON BY CAR AND COMPUTER : Difficulties Associated With Large Maps

pp.：  118 – 140

Chapter Four. PROOF OF THE VALIDITY OF THE METHOD

pp.：  140 – 159

Chapter Five. JUGGLING JUGS

pp.：  159 – 191

Chapter Six. THE SAWYER GRAPH AND THE BILLIARD BALL COMPUTER

pp.：  191 – 213

Chapter Seven. CANNIBALS AND MISSIONARIES

pp.：  213 – 230

Chapter Eight. THE 'TRAVELLING SALESMAN' AND OTHER SCHEDULING PROBLEMS

pp.：  230 – 256

Author lndex

pp.：  256 – 260

Subject Index

pp.：  260 – 264

Mathematics in Science and Engineering

pp.：  264 – 267

The users who browse this book also browse


No browse record.