Matroid optimisation problems with nested non-linear monomials in the objective function
暂无分享,去创建一个
[1] Frauke Liers,et al. An exact solution method for quadratic matching: The one-quadratic-term technique and generalisations , 2015, Discret. Optim..
[2] Christoph Buchheim,et al. The spanning tree problem with one quadratic term , 2013, CTW.
[3] Fred W. Glover,et al. Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems , 1973, Oper. Res..
[4] R. Brualdi. Comments on bases in dependence structures , 1969, Bulletin of the Australian Mathematical Society.
[5] Janny Leung,et al. On The Boolean Quadric Forest Polytope , 2004 .
[6] Fred W. Glover,et al. Technical Note - Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program , 1974, Oper. Res..
[7] James G. Oxley,et al. Matroid theory , 1992 .
[8] Matthias Walter,et al. Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs , 2016, SIAM J. Discret. Math..
[9] Christoph Buchheim,et al. Combinatorial optimization with one quadratic term: Spanning trees and forests , 2014, Discret. Appl. Math..
[10] Satoru Fujishige,et al. Submodular functions and optimization , 1991 .
[11] Hanif D. Sherali,et al. A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..
[12] Martin Grötschel,et al. Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme , 1977 .
[13] Anja Fischer,et al. Complete description for the spanning tree problem with one linearised quadratic term , 2013, Oper. Res. Lett..
[14] S. Thomas McCormick,et al. Submodular Function Minimization , 2005 .
[15] Yves Crama,et al. A class of valid inequalities for multilinear 0-1 optimization problems , 2017, Discret. Optim..
[16] Warren P. Adams,et al. A hierarchy of relaxation between the continuous and convex hull representations , 1990 .
[17] Manfred W. Padberg,et al. The boolean quadric polytope: Some characteristics, facets and relatives , 1989, Math. Program..
[18] Alexander Schrijver,et al. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.
[19] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[20] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..
[21] Alberto Del Pia,et al. A Polyhedral Study of Binary Polynomial Programs , 2017, Math. Oper. Res..
[22] R. Fortet. L’algebre de Boole et ses applications en recherche operationnelle , 1960 .
[23] Jesús A. De Loera,et al. Computation in multicriteria matroid optimization , 2009, JEAL.
[24] Warren P. Adams,et al. A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .
[25] Giovanni Rinaldi,et al. Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case , 2007, SIAM J. Optim..
[26] Hanif D. Sherali,et al. A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..
[27] Shmuel Onn,et al. Convex Matroid Optimization , 2002, SIAM J. Discret. Math..
[28] Laura Klein. Combinatorial optimization with one quadratic term , 2014 .
[29] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[30] Eva Riccomagno,et al. Nonlinear Matroid Optimization and Experimental Design , 2007, SIAM J. Discret. Math..
[31] Jack Edmonds,et al. Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.