References in zbMATH (referenced in 19 articles , 1 standard article )

Showing results 1 to 19 of 19.
Sorted by year (citations)

  1. Wu, Qinghua; Hao, Jin-Kao: A review on algorithms for maximum clique problems (2015)
  2. Laurent, Monique; Varvitsiotis, Antonios: A new graph parameter related to bounded rank positive semidefinite matrix completions (2014)
  3. Bi, Shujun; Han, Le; Pan, Shaohua: Approximation of rank function and its application to the nearest low-rank correlation matrix (2013)
  4. Gruzdeva, Tatyana V.: On a continuous approach for the maximum weighted clique problem (2013)
  5. Smith, Derek H.; Montemanni, Roberto: Permutation codes with specified packing radius (2013)
  6. Smith, Derek H.; Montemanni, Roberto: A new table of permutation codes (2012)
  7. Burer, Samuel: On the copositive representation of binary and continuous nonconvex quadratic programs (2009)
  8. Aumasson, Jean-Philippe; Fischer, Simon; Khazaei, Shahram; Meier, Willi; Rechberger, Christian: New features of Latin dances: analysis of Salsa, ChaCha, and Rumba (2008)
  9. Gvozdenović, Nebojša; Laurent, Monique: Computing semidefinite programming lower bounds for the (fractional) chromatic number via block-diagonalization (2008)
  10. Grosso, Andrea; Locatelli, Marco; Pullan, Wayne: Simple ingredients leading to very efficient heuristics for the maximum clique problem (2007)
  11. Laurent, Monique: Semidefinite representations for finite varieties (2007)
  12. Balasundaram, Balabhaskar; Butenko, Sergiy: On a polynomial fractional formulation for independence number of a graph (2006)
  13. Busygin, Stanislav: A new trust region technique for the maximum weight clique problem (2006)
  14. Yildirim, E.Alper; Fan-Orzechowski, Xiaofei: On extracting maximum stable sets in perfect graphs using Lovász’s theta function (2006)
  15. Bomze, Immanuel M.; Palagi, Laura: Quartic formulation of standard quadratic optimization problems (2005)
  16. Katayama, Kengo; Hamamoto, Akihiro; Narihisa, Hiroyuki: An effective local search for the maximum clique problem (2005)
  17. Krishnan, Kartik; Mitchell, John E.: Semi-infinite linear programming approaches to semidefinite programming problems (2003)
  18. Burer, Samuel; Monteiro, Renato D.C.; Zhang, Yin: Maximum stable set formulations and heuristics based on continuous optimization (2002)
  19. Monteiro, Renato D.C.; Adler, Ilan: An extension of Karmarkar type algorithm to a class of convex separable programming problems with global linear rate of convergence (1990)