113:
wrote, "This book is an attractive, well-written account of a fairly new topic in pure and applied combinatorial analysis." As a topic of continued interest, a new edition was published in 2010 with a new foreword by
641:
109:. According to the preface, it "included topics that were purely mathematically motivated, together with those that are strictly utilitarian in concept." In his review,
621:
616:
232:
626:
651:
295:
636:
447:
374:
631:
542:
407:
656:
322:
231:
which provided him a scholarship. He earned his bachelor's degree in 1949 and a masters in 1950. Ford continued his studies at
94:
646:
243:
134:
149:
126:
399:
369:, International series in operations research & management science, vol. 75, Springer-Verlag, p. 96,
106:
574:
537:, Wiley Series in Discrete Mathematics and Optimization, vol. 54, John Wiley & Sons, pp. 286–288,
300:
98:
314:
557:
259:
228:
156:
with the fewest comparisons. For 20 years, this algorithm required the minimum number of comparisons.
611:
606:
224:
90:
286:
196:
192:
97:
for solving it, published as a technical report in 1954 and in a journal in 1956, established the
347:
255:
251:
220:
538:
530:
443:
403:
370:
290:
191:)) with sides parallel to the axes of the plane (page 9). Frames are then exploited to define
145:
501:
331:
247:
515:
453:
428:
343:
511:
485:
465:
450:
425:
339:
258:. Ford married twice. With his first wife, Janet Johnson, he had nine children, including
153:
138:
115:
86:
422:
208:
119:
80:
31:
392:
152:
for sorting, which is of theoretical interest in connection with the problem of doing
600:
159:
In 1963 along with his father Lester R. Ford, he published an innovative textbook on
130:
72:
351:
264:
76:
110:
17:
561:
239:
469:
176:
335:
506:
489:
160:
219:
and was frequently heard whistling. For higher education he considered
365:
Gass, Saul I.; Assad, Arjang (2005), "1954 Max-flow min-cut theorem",
216:
212:
367:
An annotated timeline of operations research: an informal history
474:. Paper P-923. Santa Monica, California: RAND Corporation.
71:(September 23, 1927 – February 26, 2017) was an American
58:
46:
39:
391:
254:employed him for forty years as he kept pace with
439:Ford & Fulkerson (2010) paperback edition of
575:"Lester R. Ford Jr. of Santa Barbara, 1927-2017"
235:where he earned a Ph.D. in mathematics in 1953.
642:University of Illinois Urbana-Champaign alumni
137:that have negative weights, two years before
8:
268:Universe. His second wife was Naoma Gower.
313:Ford, L. R. Jr.; Fulkerson, D. R. (1956),
233:University of Illinois at Urbana-Champaign
211:on September 23, 1927. He learned to play
79:problems. He was the son of mathematician
36:
505:
296:MacTutor History of Mathematics Archive
277:
250:. The Defense Research Corporation of
7:
622:21st-century American mathematicians
617:20th-century American mathematicians
390:L. R. Ford; D. R. Fulkerson (1962).
531:"12.3.1 The Ford–Johnson algorithm"
27:American mathematician (1927–2017)
25:
556:Lester Ford Sr. & Jr. (1963)
494:Quarterly of Applied Mathematics
315:"Maximal flow through a network"
627:American operations researchers
323:Canadian Journal of Mathematics
41:Lester “Les” Randolph Ford, Jr.
652:People from Goleta, California
535:Sorting: A Distribution Theory
238:Ford's employers included the
141:also published the algorithm.
1:
637:University of Chicago alumni
244:University of North Carolina
125:In 1956, Ford developed the
673:
529:Mahmoud, Hosam M. (2011),
400:Princeton University Press
195:(page 10) and to describe
107:Princeton University Press
29:
632:American textbook writers
101:. In 1962 they published
301:University of St Andrews
99:max-flow min-cut theorem
95:Ford–Fulkerson algorithm
69:Lester Randolph Ford Jr.
30:Not to be confused with
657:RAND Corporation people
163:. For a given function
490:"On a routing problem"
336:10.4153/cjm-1956-045-5
291:"Lester Randolph Ford"
150:Ford–Johnson algorithm
127:Bellman–Ford algorithm
229:University of Chicago
287:Robertson, Edmund F.
262:, programmer of the
225:Oberlin Conservatory
203:Personal information
197:integrable functions
193:continuous functions
91:maximum flow problem
50:September 23rd, 1927
647:People from Houston
471:Network Flow Theory
468:(August 14, 1956).
466:Ford, Lester R. Jr.
285:O'Connor, John J.;
207:Lester was born in
148:, he developed the
62:February 26th, 2017
560:, McGraw-Hill via
507:10.1090/qam/102435
256:digital revolution
252:Goleta, California
85:Ford's paper with
81:Lester R. Ford Sr.
448:978-0-691-14667-6
441:Flows in Networks
394:Flows in Networks
376:978-1-4020-8112-5
171:, they defined a
146:Selmer M. Johnson
103:Flows in Networks
66:
65:
16:(Redirected from
664:
591:
590:
588:
586:
571:
565:
554:
548:
547:
526:
520:
519:
509:
486:Bellman, Richard
482:
476:
475:
462:
456:
437:
431:
420:
414:
413:
397:
387:
381:
379:
362:
356:
354:
319:
310:
304:
303:
282:
248:RAND Corporation
227:, but chose the
75:specializing in
37:
21:
672:
671:
667:
666:
665:
663:
662:
661:
597:
596:
595:
594:
584:
582:
573:
572:
568:
555:
551:
545:
528:
527:
523:
484:
483:
479:
464:
463:
459:
438:
434:
421:
417:
410:
389:
388:
384:
377:
364:
363:
359:
317:
312:
311:
307:
284:
283:
279:
274:
205:
154:comparison sort
139:Richard Bellman
116:Robert G. Bland
87:D. R. Fulkerson
54:
51:
42:
35:
28:
23:
22:
18:L. R. Ford, Jr.
15:
12:
11:
5:
670:
668:
660:
659:
654:
649:
644:
639:
634:
629:
624:
619:
614:
609:
599:
598:
593:
592:
581:. 2 March 2017
566:
549:
543:
521:
477:
457:
432:
423:Solomon Golomb
415:
408:
382:
375:
357:
305:
276:
275:
273:
270:
209:Houston, Texas
204:
201:
131:shortest paths
120:James B. Orlin
64:
63:
60:
56:
55:
52:
48:
44:
43:
40:
32:Lester R. Ford
26:
24:
14:
13:
10:
9:
6:
4:
3:
2:
669:
658:
655:
653:
650:
648:
645:
643:
640:
638:
635:
633:
630:
628:
625:
623:
620:
618:
615:
613:
610:
608:
605:
604:
602:
580:
576:
570:
567:
563:
559:
553:
550:
546:
544:9781118031131
540:
536:
532:
525:
522:
517:
513:
508:
503:
499:
495:
491:
487:
481:
478:
473:
472:
467:
461:
458:
455:
452:
449:
445:
442:
436:
433:
430:
427:
424:
419:
416:
411:
409:9780691079622
405:
401:
396:
395:
386:
383:
378:
372:
368:
361:
358:
353:
349:
345:
341:
337:
333:
329:
325:
324:
316:
309:
306:
302:
298:
297:
292:
288:
281:
278:
271:
269:
267:
266:
261:
257:
253:
249:
245:
241:
236:
234:
230:
226:
222:
218:
214:
210:
202:
200:
198:
194:
190:
186:
182:
178:
174:
170:
166:
162:
157:
155:
151:
147:
142:
140:
136:
132:
128:
123:
121:
117:
112:
108:
104:
100:
96:
92:
88:
83:
82:
78:
74:
73:mathematician
70:
61:
57:
49:
45:
38:
33:
19:
583:. Retrieved
579:noozhawk.com
578:
569:
552:
534:
524:
497:
493:
480:
470:
460:
440:
435:
418:
393:
385:
366:
360:
327:
321:
308:
294:
280:
265:Star Control
263:
237:
206:
199:(page 148).
188:
184:
180:
179:containing (
172:
168:
164:
158:
143:
129:for finding
124:
102:
84:
77:network flow
68:
67:
612:2017 deaths
607:1927 births
330:: 399–404,
111:S.W. Golomb
53:Houston, TX
601:Categories
562:HathiTrust
272:References
240:U. S. Army
167:and point
500:: 87–90.
260:Fred Ford
177:rectangle
585:17 March
558:Calculus
488:(1958).
352:16109790
215:and the
161:calculus
93:and the
516:0102435
454:2729968
429:0159700
344:0079251
221:Harvard
89:on the
541:
514:
446:
406:
373:
350:
342:
135:graphs
348:S2CID
318:(PDF)
217:flute
213:piano
175:as a
173:frame
144:With
105:with
587:2019
539:ISBN
444:ISBN
404:ISBN
371:ISBN
246:and
223:and
118:and
59:Died
47:Born
502:doi
332:doi
133:in
603::
577:.
533:,
512:MR
510:.
498:16
496:.
492:.
451:MR
426:MR
402:.
398:.
346:,
340:MR
338:,
326:,
320:,
299:,
293:,
289:,
242:,
183:,
122:.
589:.
564:.
518:.
504::
412:.
380:.
355:.
334::
328:8
189:x
187:(
185:f
181:x
169:x
165:f
34:.
20:)
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.