Skip to search formSkip to main contentSkip to account menu

Fulkerson Prize

Known as: Fulkerson 
The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Vélo’v 
2010
2010
In this paper, we continue our development of algorithms used for topological network discovery. We present native P system… 
2004
2004
ZusammenfassungMit der Anteromedialisierung der Tuberositas tibiae (Fulkerson-Operation) steht ein zuverlässiges Verfahren zur… 
1986
1986
LetP be the convex hull of perfect matchings of a graphG=(V, E). The dominant ofP is {y∈RE∶y≥x for somex∈P}. A theorem of… 
1980
1980
Fulkerson et al. have given two examples of set covering problems that are empirically difficult to solve. They arise from… 
1979
1979
LetC andA be (0, 1)-valued matrices with no zero columns. Fulkerson has shown that the extreme points of {x: Cx ≤ 1,x ≥ 0} are… 
1972
1972
The estimate of expected critical-path length in PERT networks in this paper is usually better than the Fulkerson estimate… 
Highly Cited
1963
Highly Cited
1963
For a project that consists of numerous jobs subject to technological ordering restrictions the polygon representing project cost…