Ford, L. R. (Lester Randolph) 1927
Overview
Works:  35 works in 85 publications in 4 languages and 1,251 library holdings 

Roles:  Author 
Classifications:  QA265, 519.92 
Publication Timeline
.
Most widely held works by
L. R Ford
Flows in networks by
Lester R Ford(
Book
)
14 editions published between 1962 and 2011 in 3 languages and held by 883 WorldCat member libraries worldwide
The techniques presented by Ford and Fulkerson spurred the development of powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming. In addition, the book helped illuminate and unify results in combinatorial mathematics while emphasizing proofs based on computationally efficient construction
14 editions published between 1962 and 2011 in 3 languages and held by 883 WorldCat member libraries worldwide
The techniques presented by Ford and Fulkerson spurred the development of powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming. In addition, the book helped illuminate and unify results in combinatorial mathematics while emphasizing proofs based on computationally efficient construction
Calculus by
Lester R Ford(
Book
)
11 editions published in 1963 in English and Spanish and held by 206 WorldCat member libraries worldwide
11 editions published in 1963 in English and Spanish and held by 206 WorldCat member libraries worldwide
Flows in networks, by L.R. Ford [and] D.R. Fulkerson by
L. R Ford(
Book
)
1 edition published in 1962 in English and held by 15 WorldCat member libraries worldwide
1 edition published in 1962 in English and held by 15 WorldCat member libraries worldwide
Network flow and systems of representatives by
L. R Ford(
Book
)
3 editions published between 1956 and 1957 in English and held by 12 WorldCat member libraries worldwide
Two basic theorems of network flow theory are applied to determine necessary and sufficient conditions for (a) the existence of a system of representatives for a collection of subsets of a given set such that each element, a sub i of the given set occurs at least alpha sub i times in the system and at most beta sub i times (a system of restricted representatives), and (b) the existence of a common system of restricted representatives for two different collections of subsets of the given set. (Author)
3 editions published between 1956 and 1957 in English and held by 12 WorldCat member libraries worldwide
Two basic theorems of network flow theory are applied to determine necessary and sufficient conditions for (a) the existence of a system of representatives for a collection of subsets of a given set such that each element, a sub i of the given set occurs at least alpha sub i times in the system and at most beta sub i times (a system of restricted representatives), and (b) the existence of a common system of restricted representatives for two different collections of subsets of the given set. (Author)
A primal dual algorithm for the capacitated Hitchcock problem by
L. R Ford(
Book
)
2 editions published in 1956 in English and held by 11 WorldCat member libraries worldwide
2 editions published in 1956 in English and held by 11 WorldCat member libraries worldwide
Flows in network by
L. R Ford(
Book
)
3 editions published between 1962 and 1974 in English and held by 11 WorldCat member libraries worldwide
3 editions published between 1962 and 1974 in English and held by 11 WorldCat member libraries worldwide
Maximal flow through a network by
L. R Ford(
Book
)
3 editions published between 1954 and 1955 in English and held by 10 WorldCat member libraries worldwide
3 editions published between 1954 and 1955 in English and held by 10 WorldCat member libraries worldwide
Solution of a ranking problem from binary comparisons by
L. R Ford(
Book
)
1 edition published in 1956 in English and held by 8 WorldCat member libraries worldwide
A method for solving a ranking problem from binary comparisons which does not require any specific number of comparisons beetween pairs. This procedure may be applied to such problems as ranking (1) various makes of automobiles and (2) players of a twoperson game on the basis of their records against each other
1 edition published in 1956 in English and held by 8 WorldCat member libraries worldwide
A method for solving a ranking problem from binary comparisons which does not require any specific number of comparisons beetween pairs. This procedure may be applied to such problems as ranking (1) various makes of automobiles and (2) players of a twoperson game on the basis of their records against each other
Network flow theory by
L. R Ford(
Book
)
3 editions published in 1956 in English and held by 8 WorldCat member libraries worldwide
The labeling algorithm for the solution of maximal network flow problems and its application to various problems of the transportation type are discussed. (Author)
3 editions published in 1956 in English and held by 8 WorldCat member libraries worldwide
The labeling algorithm for the solution of maximal network flow problems and its application to various problems of the transportation type are discussed. (Author)
Constructing maximal dynamic flows from static flows by
L. R Ford(
Book
)
2 editions published in 1957 in English and held by 8 WorldCat member libraries worldwide
2 editions published in 1957 in English and held by 8 WorldCat member libraries worldwide
A simple algorithm for finding maximal network flows and an application to the Hitchcock problem by
L. R Ford(
Book
)
2 editions published between 1955 and 1956 in English and held by 7 WorldCat member libraries worldwide
2 editions published between 1955 and 1956 in English and held by 7 WorldCat member libraries worldwide
Construction of maximal dynamic flows in networks by
L. R Ford(
Book
)
2 editions published in 1957 in English and held by 7 WorldCat member libraries worldwide
This note describes briefly an algorithm for solving the following problem. Suppose given a network (linear graph) in which each link has associated with it two positive integers, one a commodity flow capacity, the other a traversal time. Assuming that some node of the network is a source for the commodity, another a sink, and the remaining may either transship the commodity immediately on receipt or hold for later shipment, what is the maximal amount that can be shipped from source to sink in any given number of time periods. No proofs are given
2 editions published in 1957 in English and held by 7 WorldCat member libraries worldwide
This note describes briefly an algorithm for solving the following problem. Suppose given a network (linear graph) in which each link has associated with it two positive integers, one a commodity flow capacity, the other a traversal time. Assuming that some node of the network is a source for the commodity, another a sink, and the remaining may either transship the commodity immediately on receipt or hold for later shipment, what is the maximal amount that can be shipped from source to sink in any given number of time periods. No proofs are given
Flows in networks, by L.R. Ford, Jr. [and] D.R. Fulkerson by
L. R Ford(
Book
)
1 edition published in 1962 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1962 in English and held by 5 WorldCat member libraries worldwide
A cyclic arrangement of ntuples by
L. R Ford(
Book
)
1 edition published in 1957 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1957 in English and held by 5 WorldCat member libraries worldwide
Notes on linear programming. a primaldual algorithm by
George B Dantzig(
Book
)
2 editions published in 1956 in English and held by 5 WorldCat member libraries worldwide
"The procedure developed by two of the authors (Ford and Fulkerson) for solving transportation problems is a natural extension of the KuhnEgerváry method for solving assignment problems. In the present paper the procedure is extended further to the general linear programming case."Summary
2 editions published in 1956 in English and held by 5 WorldCat member libraries worldwide
"The procedure developed by two of the authors (Ford and Fulkerson) for solving transportation problems is a natural extension of the KuhnEgerváry method for solving assignment problems. In the present paper the procedure is extended further to the general linear programming case."Summary
Notes on linear programming by
L. R Ford(
Book
)
2 editions published in 1956 in English and held by 5 WorldCat member libraries worldwide
A paper which describes a new computing procedure for the HitchcockKoopmans transportation problem and gives a stepbystep solution of an illustrative example. The procedure is based on Kuhn's combinatorial algorithm for the assignment problem and a simple labeling process for solving maximal flow problems in networks
2 editions published in 1956 in English and held by 5 WorldCat member libraries worldwide
A paper which describes a new computing procedure for the HitchcockKoopmans transportation problem and gives a stepbystep solution of an illustrative example. The procedure is based on Kuhn's combinatorial algorithm for the assignment problem and a simple labeling process for solving maximal flow problems in networks
Differential equations by
Lester R Ford(
Book
)
3 editions published in 1955 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 1955 in English and held by 4 WorldCat member libraries worldwide
Solving the transportation problem by
L. R Ford(
Book
)
2 editions published in 1956 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1956 in English and held by 4 WorldCat member libraries worldwide
Przepływy w sieciach by
Lester Randolph Ford(
Book
)
2 editions published in 1969 in Polish and held by 4 WorldCat member libraries worldwide
2 editions published in 1969 in Polish and held by 4 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
Binary system (Mathematics) Calculus Computer networks Differential equations Economics EconomicsMathematical models Forms (Mathematics) Graph theory Linear programming Mathematical optimization Maxima and minima Network analysis (Planning) PERT (Network analysis) Recursion theory System analysis TransportationLinear programming Transportation problems (Programming)
Covers
Alternative Names
Ford, L. R.
Ford, L. R. 1927
Ford, L. R. Jr
Ford, L. R., Jr., 1927
Ford, Lester R.
Ford, Lester R. Jr
Ford, Lester R., Jr., 1927
Ford, Lester Randolf
Ford, Lester Randolph
Ford, Lester Randolph 1927
Ford, Lester Randolph junior 1927
L. R. Ford, Jr Amerikaans wiskundige
L. R. Ford, Jr. matemático estadounidense
L. R. Ford, Jr. matematico statunitense
L. R. Ford, Jr mathématicien américain
L. R. Ford mlajši
Lester Randolph Ford, Jr
Lester Randolph Ford, Jr. Amerykański matematyk
Lester Randolph Ford junior USamerikanischer Mathematiker
Форд, Л. Р..
Форд, Лестер
Форд, Лестер Aмериканский математик
レスター・フォード Jr.
Languages