33 citations to 10.1287/moor.17.4.981 (Crossref Cited-By Service)
  1. Adam N. Letchford, Michael M. Sørensen, “Binary positive semidefinite matrices and associated integer polytopes”, Math. Program., 131, № 1-2, 2012, 253  crossref
  2. M. Labbé, F. Aykut Özsoy, “Size-constrained graph partitioning polytopes”, Discrete Mathematics, 310, № 24, 2010, 3473  crossref
  3. Vilmar Jefté Rodrigues de Sousa, Miguel F. Anjos, Sébastien Le Digabel, “Computational study of valid inequalities for the maximum k-cut problem”, Ann Oper Res, 265, № 1, 2018, 5  crossref
  4. Walid Ben‐Ameur, Ali Ridha Mahjoub, José Neto, Paradigms of Combinatorial Optimization, 2014, 131  crossref
  5. Adam N. Letchford, Michael M. Sørensen, 5035, Integer Programming and Combinatorial Optimization, 2008, 125  crossref
  6. Caterina De Simone, Michel Deza, Monique Laurent, “Collapsing and lifting for the cut cone”, Discrete Mathematics, 127, № 1-3, 1994, 105  crossref
  7. Hamidreza Validi, Austin Buchanan, “Political districting to minimize cut edges”, Math. Prog. Comp., 14, № 4, 2022, 623  crossref
  8. Andreas Eisenblätter, 2337, Integer Programming and Combinatorial Optimization, 2002, 273  crossref
  9. Michel Deza, Monique Laurent, “Applications of cut polyhedra — I”, Journal of Computational and Applied Mathematics, 55, № 2, 1994, 191  crossref
  10. E.R. van Dam, R. Sotirov, “New bounds for the max-k-cut and chromatic number of a graph”, Linear Algebra and its Applications, 488, 2016, 216  crossref
1
2
3
4
Следующая