Você procurou por: fulkerson (Espanhol - Inglês)

fulkerson recibió su ph.d. en la universidad de wisconsin-madison en 1951.
fulkerson received his ph.d. in 1951.

en 2009, recibió el premio fulkerson dado por la american mathematical society y la sociedad de programación matemática.
in 2009, he received the fulkerson prize given by the american mathematical society and the mathematical programming society.

su nombre viene dado por sus creadores, l. r. ford, jr. y d. r. fulkerson.
it was published in 1956 by l. r. ford, jr. and d. r. fulkerson.

en 1982 ganó el prestigioso premio fulkerson de la sociedad de programación matemática y la sociedad americana de matemática, por sus artículos en el área de matemática discreta.
in 1982 he won the prestigious fulkerson prize from the mathematical programming society and the american mathematical society for outstanding papers in the area of discrete mathematics.

un refinamiento de estos métodos llevó a un algoritmo aleatorio de aproximación de tiempo polinomial para el cómputo del permanente, con el cual sinclair y sus co-autores recibieron el premio fulkerson en 2006.
a refinement of these methods led to a fully polynomial time randomised approximation algorithm for computing the permanent, for which sinclair and his co-authors received the fulkerson prize in 2006.

== algoritmo ==el algoritmo es idéntico al algoritmo de ford-fulkerson, excepto porque el orden para ir buscando los caminos aumentantes está definido.
==algorithm==the algorithm is identical to the ford–fulkerson algorithm, except that the search order when finding the augmenting path is defined.

una notable contribución fue la de george dantzig, delbert ray fulkerson y selmer m. johnson de la corporación rand en santa mónica, quienes expresaron el problema como programación lineal en enteros y desarrollaron para solucionarlo el método de planos cortantes.
notable contributions were made by george dantzig, delbert ray fulkerson and selmer m. johnson at the rand corporation in santa monica, who expressed the problem as an integer linear program and developed the cutting plane method for its solution.

una solución exacta para 15,112 pueblos alemanes desde tsplib fue encontrada en 2001 usando el método de planos cortantes propuesto por george dantzig, ray fulkerson, y selmer m. johnson en 1954, basados en la programación lineal.
an exact solution for 15,112 german towns from tsplib was found in 2001 using the cutting-plane method proposed by george dantzig, ray fulkerson, and selmer m. johnson in 1954, based on linear programming.

== enlaces externos ==* official museum site* sid richardson museum; includes biography* www.charlesmarionrussell.org 164 works by charles marion russell* gallery at museumsyndicate* r. w. norton art gallery feature on the artist charles marion russell: the trappers' last stand aka attack on the plains* larger images* st. louis walk of fame* col. william h. fulkerson mansion and festival site around russell's extended family mansion.
== external links ==*official museum site*sid richardson museum; includes biography*www.charlesmarionrussell.org 164 works by charles marion russell*gallery at museumsyndicate*r. w. norton art gallery feature on the artist charles marion russell: the trappers' last stand aka attack on the plains*larger images*st. louis walk of fame**"charles m. russell, cowboy artist", by wallace d. coburn, "national magazine", june, 1905 (with photos)*col. william h. fulkerson mansion and festival site around russell's extended family mansion.