Peter N. Malkin

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Sherali-Adams relaxations of graph isomorphism polytopes Discrete Optimization	2015-04-09	Paper
Computation with polynomial equations and inequalities arising in combinatorial optimization Mixed Integer Nonlinear Programming	2012-07-10	Paper
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz Journal of Symbolic Computation	2011-12-07	Paper
Recognizing graph theoretic properties with polynomial ideals The Electronic Journal of Combinatorics	2010-10-13	Paper
Recognizing graph theoretic properties with polynomial ideals The Electronic Journal of Combinatorics	2010-10-13	Paper
Recognizing graph theoretic properties with polynomial ideals The Electronic Journal of Combinatorics	2010-10-13	Paper
Computing generating sets of lattice ideals and Markov bases of lattices Journal of Symbolic Computation	2009-09-14	Paper
Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility (available as arXiv preprint)	2009-01-20	Paper
Truncated Markov bases and Gr\"obner bases for Integer Programming	2006-12-20	Paper
Truncated Markov bases and Gröbner bases for Integer Programming (available as arXiv preprint)	2006-01-01	Paper

Research outcomes over time

This page was built for person: Peter N. Malkin