Egerváry Research Group on Combinatorial Optimization a Constrained Independent Set Problem for Matroids a Constrained Independent Set Problem for Matroids
暂无分享,去创建一个
[1] A. Frank. An Algorithm for Submodular Functions on Graphs , 1982 .
[2] André Bouchet,et al. Greedy algorithm and symmetric matroids , 1987, Math. Program..
[3] William H. Cunningham,et al. Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra , 1995, SIAM J. Discret. Math..
[4] Peter Kleinschmidt,et al. A constrained matching problem , 1995, Ann. Oper. Res..
[5] Satoru Fujishige,et al. Submodular functions and optimization , 1991 .
[6] Andreas Hefner,et al. A Min-Max Theorem for a Constrained Matching Problem , 1997, SIAM J. Discret. Math..
[7] András Recski,et al. Sufficient conditions for the unique solvability of linear networks containing memoryless 2-ports , 1980 .
[8] Jack Edmonds,et al. Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.