富尔克森奖

Template:Infobox award

富尔克森奖（Template:Lang-en）是Template:En-link和美国数学学会联合设立的奖项，专门奖励离散数学领域的杰出论文。在国际数学优化学会每三年召开一次的大会上奖励至多三篇论文，奖金各1500美元。最初奖金来自于一个纪念基金。此纪念基金是由数学家Template:En-link的朋友们建立的、美国数学学会管理，用于激励富尔克森自己研究领域的杰出数学成果。目前奖金来自于国际数学优化学会管理的一笔捐赠资产。

获奖论文

^[1]

1979年:
- 理查德·卡普 - 对很多重要的NP完全问题进行分类。^[2]
- 凱尼斯·阿佩爾和沃夫冈·哈肯 - 四色定理。^[3]
- Template:En-link - 把最大流最小割定理推广到拟阵。^[4]
1982:
- D.B. Judin, 阿爾卡迪·內米羅夫斯基, Template:En-link, Template:En-link, 洛瓦兹·拉兹洛和 Template:En-link - 线性规划和组合优化中的Template:En-link。^[5]^[6] ^[7] ^[8]
- Template:En-link和D. I. Falikman - 证明范德瓦尔登的猜想：所有元素都相等的矩阵在所有Template:Link-en中有着最小的积和式。^[9]^[10]
1985:
- Template:En-link - 等差数列的Template:En-link的紧界。^[11]
- 亨德里克·倫斯特拉 - 应用几何数论在约束个数的多项式时间内求解变元数较少的整数规划问题。^[12]
- Template:En-link - 对于最大度有上界的图求解图同构问题的多项式时间算法。^[13]^[14]
1988:
- 愛娃·塔多斯 - 在强多项式时间内求解网络中的最小费用环流。^[15]
- Template:En-link - 线性规划中的Template:En-link。^[16]
1991:
- Martin E. Dyer, Alan M. Frieze 和 Ravindran Kannan - 基于隨機漫步的计算凸体体积的近似算法。^[17]
- Alfred Lehman - 关于邏輯矩陣的完美图理论。^[18]
- Nikolai E. Mnev - Template:En-link：每个Template:En-link都等价于一个定向拟阵的所有实现构成的空间。^[19]
1994:
- Template:En-link - 求出空间Template:En-link上的分段多项式函数空间的基。^[20]
- Template:En-link - 在Template:En-link上的进展。^[21]
- Template:En-link, Template:En-link和罗宾·托马斯 - Template:En-link的6色情形。^[22]
1997:
- Template:En-link - 求出拉姆齐数R(3,t)的渐进增长率。^[23]
2000:
- Template:En-link和Template:En-link - 基于半正定规划的近似算法。^[24]
- Michele Conforti, Template:En-link和Template:En-link - 在多项式时间内识别Template:En-link的算法。^[25]^[26]
2003:
- Template:En-link, A. M. H. Gerards 和 A. Kapoor - 关于Template:En-link的Template:En-link在GF(4)的情形。^[27]^[28]
- Bertrand Guenin - 弱二部图的一个Template:En-link。^[29]^[28]
- Satoru Iwata, Lisa Fleischer, Satoru Fujishige和Template:En-link - 证明Template:En-link是强多项式时间的。^[30]^[31]^[28]
2006:
- Template:En-link, Template:En-link 和 Template:En-link - AKS質數測試.^[32]^[33]^[34]
- Template:En-link, 阿利斯泰尔·辛克莱尔和 Eric Vigoda - 对积和式的近似计算。^[35]^[34]
- Template:En-link 和 Template:En-link - Template:En-link。.^[36]^[34]
2009:
- Template:En-link, Neil Robertson, Paul Seymour 和罗宾·托马斯 - Template:En-link。^[37]^[38]
- Template:En-link 和滕尚华 - 线性规划算法的Template:En-link。^[39]^[38]
- 托马斯·黑尔斯和 Samuel P. Ferguson - 证明关于最密堆积的克卜勒猜想。^[40]^[41]^[38]
2012:
- Template:En-link, Satish Rao 和烏梅什·瓦茲拉尼 - 把图的Template:En-link和相关问题的近似比例从 $O (\log n)$ 改进到 $O (\sqrt{\log n})$ 。^[42]
- Anders Johansson, Template:En-link 和 Template:En-link - 确定了随机图具有下述性质的边密度的阈值：能被同构于一个给定的更小图的图的不交并覆盖。^[43]
- 洛瓦兹·拉兹洛和Template:En-link - 刻画Template:En-link序列的子图的重数。^[44]
2015 :
- Template:En-link - 举出Template:En-link的一个反例。^[45]^[46]
2018 :
- Template:En-link, Template:En-link, Simon Griffiths, Peter Allen 和 Julia Böttcher - The chromatic thresholds of graphs
- Thomas Rothvoss - The Matching Polytope has Exponential Extension Complexity

参考资料

Template:Reflist

外部链接

官方网站 Template:Wayback (MOS)
有详细介绍的官方网站 Template:Wayback (AMS website)

↑ Template:Cite web
↑ Template:Cite journal
↑ Template:Cite journal
↑ Template:Cite journal
↑ Template:Cite journal
↑ Template:Cite journal
↑ Template:Citation.
↑ Template:Cite journal
↑ Template:Cite journal
↑ Template:Cite journal
↑ Template:Cite journal
↑ Template:Cite journal
↑ Template:Cite journal
↑ Template:Citation.
↑ Template:Cite journal
↑ Template:Cite journal
↑ Template:Cite journal
↑ Alfred Lehman, "The width-length inequality and degenerate projective planes," W. Cook and P. D. Seymour (eds.), Polyhedral Combinatorics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 1, (American Mathematical Society, 1990) pp. 101-105.
↑ Nikolai E. Mnev, "The universality theorems on the classification problem of configuration varieties and convex polytope varieties," O. Ya. Viro (ed.), Topology and Geometry-Rohlin Seminar, Lecture Notes in Mathematics 1346 (Springer-Verlag, Berlin, 1988) pp. 527-544.
↑ Template:Cite journal
↑ Template:Cite journal
↑ Template:Cite journal
↑ Template:Citation.
↑ Template:Cite journal
↑ Michele Conforti, Gérard Cornuéjols, and M. R. Rao, "Decomposition of balanced matrices", Journal of Combinatorial Theory, Series B, 77 (2): 292–406, 1999.
↑ Template:Citation.
↑ J. F. Geelen, A. M. H. Gerards and A. Kapoor, "The Excluded Minors for GF(4)-Representable Matroids," Journal of Combinatorial Theory, Series B, 79 (2): 247–2999, 2000.
↑ ^28.0 ^28.1 ^28.2 2003 Fulkerson Prize citation Template:Wayback, retrieved 2012-08-18.
↑ Bertrand Guenin, "A characterization of weakly bipartite graphs," Journal of Combinatorial Theory, Series B, 83 (1): 112–168, 2001.
↑ Satoru Iwata, Lisa Fleischer, Satoru Fujishige, "A combinatorial strongly polynomial algorithm for minimizing submodular functions," Journal of the ACM, 48 (4): 761–777, 2001.
↑ Alexander Schrijver, "A combinatorial algorithm minimizing submodular functions in strongly polynomial time," Journal of Combinatorial Theory, Series B 80 (2): 346–355, 2000.
↑ Manindra Agrawal, Neeraj Kayal and Nitin Saxena, "PRIMES is in P," Annals of Mathematics, 160 (2): 781–793, 2004.
↑ Template:Citation.
↑ ^34.0 ^34.1 ^34.2 2006 Fulkerson Prize citation Template:Wayback, retrieved 2012-08-19.
↑ Mark Jerrum, Alistair Sinclair and Eric Vigoda, "A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries," Journal of the ACM, 51 (4): 671–697, 2004.
↑ Neil Robertson and Paul Seymour, "Graph Minors. XX. Wagner's conjecture," Journal of Combinatorial Theory, Series B, 92 (2): 325–357, 2004.
↑ Template:Cite journal
↑ ^38.0 ^38.1 ^38.2 2009 Fulkerson Prize citation Template:Wayback, retrieved 2012-08-19.
↑ Template:Cite journal
↑ Template:Cite journal
↑ Template:Cite journal
↑ Template:Cite journal
↑ Template:Cite journal
↑ Template:Cite journal
↑ Template:Citation
↑ 2015 Fulkerson Prize citation Template:Wayback, retrieved 2015-07-18.

[名单-1] Template:Cite web

[2] Template:Cite journal

[3] Template:Cite journal

[4] Template:Cite journal

[5] Template:Cite journal

[6] Template:Cite journal

[7] Template:Citation.

[8] Template:Cite journal

[9] Template:Cite journal

[10] Template:Cite journal

[11] Template:Cite journal

[12] Template:Cite journal

[13] Template:Cite journal

[14] Template:Citation.

[15] Template:Cite journal

[16] Template:Cite journal

[17] Template:Cite journal

[18] Alfred Lehman, "The width-length inequality and degenerate projective planes," W. Cook and P. D. Seymour (eds.), Polyhedral Combinatorics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 1, (American Mathematical Society, 1990) pp. 101-105.

[19] Nikolai E. Mnev, "The universality theorems on the classification problem of configuration varieties and convex polytope varieties," O. Ya. Viro (ed.), Topology and Geometry-Rohlin Seminar, Lecture Notes in Mathematics 1346 (Springer-Verlag, Berlin, 1988) pp. 527-544.

[20] Template:Cite journal

[21] Template:Cite journal

[22] Template:Cite journal

[23] Template:Citation.

[24] Template:Cite journal

[25] Michele Conforti, Gérard Cornuéjols, and M. R. Rao, "Decomposition of balanced matrices", Journal of Combinatorial Theory, Series B, 77 (2): 292–406, 1999.

[26] Template:Citation.

[27] J. F. Geelen, A. M. H. Gerards and A. Kapoor, "The Excluded Minors for GF(4)-Representable Matroids," Journal of Combinatorial Theory, Series B, 79 (2): 247–2999, 2000.

[fpc03-28] 28.0 ^28.1 ^28.2 2003 Fulkerson Prize citation Template:Wayback, retrieved 2012-08-18.

[29] Bertrand Guenin, "A characterization of weakly bipartite graphs," Journal of Combinatorial Theory, Series B, 83 (1): 112–168, 2001.

[30] Satoru Iwata, Lisa Fleischer, Satoru Fujishige, "A combinatorial strongly polynomial algorithm for minimizing submodular functions," Journal of the ACM, 48 (4): 761–777, 2001.

[31] Alexander Schrijver, "A combinatorial algorithm minimizing submodular functions in strongly polynomial time," Journal of Combinatorial Theory, Series B 80 (2): 346–355, 2000.

[32] Manindra Agrawal, Neeraj Kayal and Nitin Saxena, "PRIMES is in P," Annals of Mathematics, 160 (2): 781–793, 2004.

[33] Template:Citation.

[fpc06-34] 34.0 ^34.1 ^34.2 2006 Fulkerson Prize citation Template:Wayback, retrieved 2012-08-19.

[35] Mark Jerrum, Alistair Sinclair and Eric Vigoda, "A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries," Journal of the ACM, 51 (4): 671–697, 2004.

[36] Neil Robertson and Paul Seymour, "Graph Minors. XX. Wagner's conjecture," Journal of Combinatorial Theory, Series B, 92 (2): 325–357, 2004.

[37] Template:Cite journal

[fpc09-38] 38.0 ^38.1 ^38.2 2009 Fulkerson Prize citation Template:Wayback, retrieved 2012-08-19.

[39] Template:Cite journal

[40] Template:Cite journal

[41] Template:Cite journal

[42] Template:Cite journal

[43] Template:Cite journal

[44] Template:Cite journal

[45] Template:Citation

[46] 2015 Fulkerson Prize citation Template:Wayback, retrieved 2015-07-18.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14]

[15]

[16]

[17]

[18]

[19]

[20]

[21]

[22]

[23]

[24]

[25]

[26]

[27]

[28]

[29]

[30]

[31]

[32]

[33]

[34]

[35]

[36]

[37]

[38]

[39]

[40]

[41]

[42]

[43]

[44]

[45]

[46]

富尔克森奖

获奖论文

参考资料

外部链接

导航菜单

搜索