Problems on cliques and non-convex optimization

zbMATH Open1336.90096MaRDI QIDQ5262894FDOQ5262894

Authors: Tatiana V. Gruzdeva, A. S. Strekalovskiĭ 

Publication date: 10 July 2015

Recommendations

• On a continuous approach for the maximum weighted clique problem
• Solution of the clique problem by reducing it to a problem with a d.c. constraint
• On solving the maximum clique problem
• scientific article; zbMATH DE number 956845
• A nonconvex quadratic optimization approach to the maximum edge weight clique problem

zbMATH Keywords

graph theorynon-convex optimizationd.-c. constraintsd.-c. objective functionproblems on cliques

Mathematics Subject Classification ID

Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Nonconvex programming, global optimization (90C26) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (4)

• On a continuous approach for the maximum weighted clique problem
• Свойства некоторых классов функций многих переменных на дифференцируемых многообразиях и приложение их к вариационным задачам
• On continuity of functions of several variables of the class of generalized bounded variation
• Solution of the clique problem by reducing it to a problem with a d.c. constraint

Uses Software

• DIMACS

This page was built for publication: Problems on cliques and non-convex optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262894)