Search results
Results: 9
Number of items: 9
-
Gijswijt, D. C., Mittelmann, H. D., & Schrijver, A. (2012). Semidefinite code bounds based on quadruple distances. IEEE Transactions on Information Theory, 58(5), 2697-2705. https://doi.org/10.1109/TIT.2012.2184845
-
Draisma, J., Gijswijt, D. C., Lovász, L., Regts, G., & Schrijver, A. (2012). Characterizing partition functions of the vertex model. Journal of Algebra, 350(1), 197-206. https://doi.org/10.1016/j.jalgebra.2011.10.030
-
Bachoc, C., Gijswijt, D. C., Schrijver, A., & Vallentin, F. (2012). Invariant semidefinite programs. In M. F. Anjos, & J. B. Lasserre (Eds.), Handbook on semidefinite, conic and polynomial optimization (pp. 219-269). (International Series in Operations Research & Management Science; No. 166). Springer. https://doi.org/10.1007/978-1-4614-0769-0_9
-
Gijswijt, D. C., Jost, V., & Queyranne, M. (2007). Clique partitioning of interval graphs with submodular costs on the cliques. RAIRO : Operations Research, 41(3), 275-288. https://doi.org/10.1051/ro:2007024
-
Gijswijt, D. C., & Schrijver, A. (2006). New Upper Bounds for Nonbinary Codes Based on the Terwilliger Algebra and Semidefinite Programming. Journal of Combinatorial Theory. Series A, 113(8), 1719-1731. https://doi.org/10.1016/j.jcta.2006.03.010
-
Gijswijt, D. C. (2005). Integer decomposition for polyhedra defined by nearly totally unimodular matrices. SIAM Journal on Discrete Mathematics, 19(3), 798-806. https://doi.org/10.1137/S089548010343569X
-
Gijswijt, D. C., & Moree, P. (2005). A combinatorial identity arising from cobordism theory. Acta mathematica Universitatis Comenianae, 74(2), 199-203. http://www.emis.ams.org/journals/AMUC/ -
Gijswijt, D. C., & Schrijver, A. (2003). On the b-stable set polytope of graphs without bad K-4. SIAM Journal on Discrete Mathematics, 16(3), 511-516. https://doi.org/10.1137/S0895480102417343
Page of