Overview

This book presents simple, elegant methods for dealing, both in theory and in application, with a variety of problems that have formulations in terms of flows in capacity-constrained networks. Since the theoretical considerations lead in all cases to computationally efficient solution procedures, the hook provides a common meeting ground for person

Full Product Details

Author:   Lester Randolph Ford ,  D. R. Fulkerson
Publisher:   Princeton University Press
Imprint:   Princeton University Press
Volume:   1903
Dimensions:   Width: 15.20cm , Height: 1.30cm , Length: 23.50cm
Weight:   0.454kg
ISBN:  

9780691651842

ISBN 10:   0691651841
Pages:   212
Publication Date:   19 April 2016
Audience:   College/higher education ,  Professional and scholarly ,  Tertiary & Higher Education ,  Professional & Vocational
Replaced By:   9780691146676
Format:   Hardback
Publisher's Status:   Active
Availability:   Manufactured on demand  
We will order this item for you from a manufactured on demand supplier.
Language:   English

Table of Contents

*Frontmatter, pg. i*PREFACE, pg. vii*ACKNOWLEDGMENTS, pg. ix*CONTENTS, pg. xi*CHAPTER I. STATIC MAXIMAL FLOW, pg. 1*CHAPTER II. FEASIBILITY THEOREMS AND COMBINATORIAL APPLICATIONS, pg. 36*CHAPTER III. MINIMAL COST FLOW PROBLEMS, pg. 93*CHAPTER IV. MULTI-TERMINAL MAXIMAL FLOWS, pg. 173*INDEX, pg. 193*Backmatter, pg. 195

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions