Computation in multicriteria matroid optimization
暂无分享,去创建一个
Jesús A. De Loera | David Haws | Jon Lee | Allison O'Hair | J. D. Loera | Jon Lee | Allison O'Hair | D. Haws
[1] Tomomi Matsui. A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs , 1997, Algorithmica.
[2] Arthur Warburton,et al. Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems , 1985, Math. Program..
[3] Xavier Gandibleux,et al. A survey and annotated bibliography of multiobjective combinatorial optimization , 2000, OR Spectr..
[4] Shmuel Onn,et al. Convex Matroid Optimization , 2002, SIAM J. Discret. Math..
[5] Dan Suciu,et al. Journal of the ACM , 2006 .
[6] Alex Samorodnitsky,et al. Random weighting, asymptotic counting, and inverse isoperimetry , 2005, Electron. Colloquium Comput. Complex..
[7] Vangelis Th. Paschos,et al. Jon Lee, A First Course in Combinatorial Optimization, Cambridge Texts in Applied Mathematics , 2006, Eur. J. Oper. Res..
[8] W. G. Hunter,et al. Minimum Aberration 2k-p Designs , 1980 .
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] E. Ehrgott. On matroids with multiple objectives , 1996 .
[11] Eva Riccomagno,et al. Nonlinear Matroid Optimization and Experimental Design , 2007, SIAM J. Discret. Math..
[12] David W. Corne,et al. Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm , 2002, Eur. J. Oper. Res..
[13] Alexandre V. Borovik,et al. Coxeter matroid polytopes , 1997 .
[14] F. Harary,et al. On the Tree Graph of a Matroid , 1972 .
[15] Jack Dongarra,et al. LAPACK Users' guide (third ed.) , 1999 .
[16] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..
[17] Jon Lee. A First Course in Combinatorial Optimization: Polytopes and Linear Programming , 2004 .
[18] Jack Dongarra,et al. LAPACK Users' Guide, 3rd ed. , 1999 .
[19] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[20] Ed Anderson,et al. LAPACK Users' Guide , 1995 .
[21] Shmuel Onn,et al. Nonlinear bipartite matching , 2008, Discret. Optim..
[22] Yoshio Okamoto,et al. A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization , 2007, ISAAC.
[23] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[24] Susan S. Margulies,et al. Efficient high-precision dense matrix algebra on parallel architectures for nonlinear discrete optimization , 2008 .
[25] W. G. Hunter,et al. Minimum Aberration 2 k–p Designs , 1980 .
[26] I. Gelfand,et al. Combinatorial Geometries, Convex Polyhedra, and Schubert Cells , 1987 .
[27] Jon Lee,et al. Parametric nonlinear discrete optimization over well-described sets and matroid intersections , 2010, Math. Program..