31 citations to 10.1016/0377-0427(94)90020-5 (Crossref Cited-By Service)
  1. Walid Ben‐Ameur, Ali Ridha Mahjoub, José Neto, Paradigms of Combinatorial Optimization, 2014, 131  crossref
  2. Jürgen Herzog, Masoomeh Rahimbeigi, Tim Römer, “Classes of cut ideals and their Betti numbers”, São Paulo J. Math. Sci., 17, № 1, 2023, 172  crossref
  3. G. G. Guerreschi, A. Y. Matsuura, “QAOA for Max-Cut requires hundreds of qubits for quantum speed-up”, Sci Rep, 9, № 1, 2019, 6903  crossref
  4. George Christopher, Martin Farach, Michael Trick, 1136, Algorithms — ESA '96, 1996, 486  crossref
  5. Viet Hung Nguyen, Michel Minoux, Dang Phuong Nguyen, “Improved compact formulations for metric and cut polyhedra”, Electronic Notes in Discrete Mathematics, 52, 2016, 125  crossref
  6. David Avis, Hiroshi Imai, Tsuyoshi Ito, “Generating facets for the cut polytope of a graph by triangular elimination”, Math. Program., 112, № 2, 2007, 303  crossref
  7. Walid Ben‐Ameur, Ali Ridha Mahjoub, José Neto, Paradigms of Combinatorial Optimization, 2013, 131  crossref
  8. Mitra Koley, Tim Römer, “Seminormality, canonical modules, and regularity of cut polytopes”, Journal of Pure and Applied Algebra, 226, № 1, 2022, 106797  crossref
  9. Agnès Gorge, Abdel Lisser, Riadh Zorgati, “Generating cutting planes for the semidefinite relaxation of quadratic programs”, Computers & Operations Research, 55, 2015, 65  crossref
  10. Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos, “A dynamic inequality generation scheme for polynomial programming”, Math. Program., 156, № 1-2, 2016, 21  crossref
Предыдущая
1
2
3
4
Следующая