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

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

1 2 next

  1. Colombi, Marco; Mansini, Renata; Savelsbergh, Martin: The generalized independent set problem: polyhedral analysis and solution approaches (2017)
  2. Botella, Arnaud; Lévy, Bruno; Caumon, Guillaume: Indirect unstructured hex-dominant mesh generation using tetrahedra recombination (2016)
  3. Yang, Wanping; Zhao, Jinkai; Xu, Fengmin: An efficient method for convex constrained rank minimization problems based on DC programming (2016)
  4. Wu, Qinghua; Hao, Jin-Kao: A review on algorithms for maximum clique problems (2015)
  5. Laurent, Monique; Varvitsiotis, Antonios: A new graph parameter related to bounded rank positive semidefinite matrix completions (2014)
  6. Bi, Shujun; Han, Le; Pan, Shaohua: Approximation of rank function and its application to the nearest low-rank correlation matrix (2013)
  7. Gruzdeva, Tatyana V.: On a continuous approach for the maximum weighted clique problem (2013)
  8. Smith, Derek H.; Montemanni, Roberto: Permutation codes with specified packing radius (2013)
  9. Smith, Derek H.; Montemanni, Roberto: A new table of permutation codes (2012)
  10. Burer, Samuel: On the copositive representation of binary and continuous nonconvex quadratic programs (2009)
  11. Aumasson, Jean-Philippe; Fischer, Simon; Khazaei, Shahram; Meier, Willi; Rechberger, Christian: New features of Latin dances: analysis of Salsa, ChaCha, and Rumba (2008)
  12. Gvozdenović, Nebojša; Laurent, Monique: Computing semidefinite programming lower bounds for the (fractional) chromatic number via block-diagonalization (2008)
  13. Grosso, Andrea; Locatelli, Marco; Pullan, Wayne: Simple ingredients leading to very efficient heuristics for the maximum clique problem (2007)
  14. Laurent, Monique: Semidefinite representations for finite varieties (2007)
  15. Balasundaram, Balabhaskar; Butenko, Sergiy: On a polynomial fractional formulation for independence number of a graph (2006)
  16. Busygin, Stanislav: A new trust region technique for the maximum weight clique problem (2006)
  17. Yildirim, E. Alper; Fan-Orzechowski, Xiaofei: On extracting maximum stable sets in perfect graphs using Lovász’s theta function (2006)
  18. Bomze, Immanuel M.; Palagi, Laura: Quartic formulation of standard quadratic optimization problems (2005)
  19. Katayama, Kengo; Hamamoto, Akihiro; Narihisa, Hiroyuki: An effective local search for the maximum clique problem (2005)
  20. Krishnan, Kartik; Mitchell, John E.: Semi-infinite linear programming approaches to semidefinite programming problems (2003)

1 2 next