暂无分享,去创建一个
[1] Eva Riccomagno,et al. Nonlinear Matroid Optimization and Experimental Design , 2007, SIAM J. Discret. Math..
[2] James G. Oxley,et al. Matroid theory , 1992 .
[3] Uriel G. Rothblum,et al. Optimal partitions having disjoint convex and conic hulls , 1992, Math. Program..
[4] A. Takemura,et al. Minimal Basis for a Connected Markov Chain over 3 × 3 ×K Contingency Tables with Fixed Two‐Dimensional Marginals , 2003 .
[5] Refael Hassin,et al. Maximizing Classes of Two-Parameter Objectives Over Matroids , 1989, Math. Oper. Res..
[6] Seth Sullivant,et al. A finiteness theorem for Markov bases of hierarchical models , 2007, J. Comb. Theory, Ser. A.
[7] Uriel G. Rothblum,et al. Convex Combinatorial Optimization , 2003, Discret. Comput. Geom..
[8] Raymond Hemmecke,et al. A polynomial oracle-time algorithm for convex integer minimization , 2007, Math. Program..
[9] Audra E. Kosh,et al. Linear Algebra and its Applications , 1992 .
[10] A. Takemura,et al. A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph , 2011, 1102.4674.
[11] Jon Lee,et al. Parametric nonlinear discrete optimization over well-described sets and matroid intersections , 2010, Math. Program..
[12] Bernd Sturmfels,et al. Higher Lawrence configurations , 2003, J. Comb. Theory, Ser. A.
[13] R. Weismantel,et al. Convex integer maximization via Graver bases , 2006 .
[14] S. Onn. Nonlinear Discrete Optimization , 2010 .
[15] Jesús A. De Loera,et al. N-fold integer programming , 2006, Discret. Optim..
[16] Uriel G. Rothblum,et al. A Polynomial Time Algorithm for Shaped Partition Problems , 1999, SIAM J. Optim..
[17] Jesús A. De Loera,et al. All Linear and Integer Programs Are Slim 3-Way Transportation Programs , 2006, SIAM J. Optim..
[18] Peter Gritzmann,et al. Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Basis , 1993, SIAM J. Discret. Math..
[19] Raymond Hemmecke,et al. A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs , 2009, IPCO.