Integer packing sets form a well-quasi-ordering
暂无分享,去创建一个
Jeff Linderoth | Jeff T. Linderoth | Alberto Del Pia | Haoran Zhu | Dion Gijswijt | D. Gijswijt | Haoran Zhu
[1] Sanjeeb Dash,et al. Generalized Chvátal-Gomory closures for integer programs with bounds on variables , 2020, Math. Program..
[2] Andreas S. Schulz,et al. The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope , 2013, Math. Oper. Res..
[3] Joseph B. Kruskal,et al. The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept , 1972, J. Comb. Theory A.
[4] Sanjeeb Dash,et al. On the polyhedrality of cross and quadrilateral closures , 2016, Math. Program..
[5] Daniel Dadush,et al. On the Chvátal–Gomory closure of a compact convex set , 2010, Math. Program..
[6] Paul D. Seymour,et al. Graph Minors. XX. Wagner's conjecture , 2004, J. Comb. Theory B.
[7] 丸山 徹. Convex Analysisの二,三の進展について , 1977 .
[8] Sanjeeb Dash,et al. On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width , 2017, SIAM J. Optim..
[9] Péter L. Erdös. Splitting property in infinite posets , 1997, Discret. Math..
[10] Julia F. Knight,et al. Chains and antichains in partial orderings , 2009, Arch. Math. Log..
[11] Eleftherios Tachtsis. On Ramsey's Theorem and the existence of Infinite Chains or Infinite Anti-Chains in Infinite Posets , 2016, J. Symb. Log..
[12] Ralf Schindler. Set Theory: Exploring Independence and Truth , 2014 .
[13] Sebastian Pokutta,et al. Aggregation-based cutting-planes for packing and covering integer programs , 2018, Math. Program..
[14] Robert R. Meyer,et al. On the existence of optimal solutions to integer and mixed-integer programming problems , 1974, Math. Program..
[15] Kent Andersen,et al. An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets , 2009, Math. Oper. Res..
[16] B. Mohar,et al. Graph minors XXIII. Nash-Williams' immersion conjecture , 2010, J. Comb. Theory B.
[17] Graham Higman,et al. Ordering by Divisibility in Abstract Algebras , 1952 .
[18] Kanstantsin Pashkovich,et al. The aggregation closure is polyhedral for packing and covering integer programs , 2021, Mathematical Programming.
[19] L. Dickson. Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .
[20] Gennadiy Averkov. On finitely generated closures in the theory of cutting planes , 2012, Discret. Optim..