Continuous Characterizations of the Maximum Clique Problem
From MaRDI portal
Publication:4361794
DOI10.1287/moor.22.3.754zbMath0883.90098OpenAlexW2099168123MaRDI QIDQ4361794
Motakuri V. Ramana, Luana E. Gibbons, Donald W. Hearn, Panos M. Pardalos
Publication date: 29 March 1998
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/664fd62e320785badd97c0f3d1880464386595f5
Related Items
Annealed replication: A new heuristic for the maximum clique problem, Maximum cliques of hypergraphs and polynomial optimization, Maximum weighted induced subgraphs, A spinorial formulation of the maximum clique problem of a graph, On standard quadratic programs with exact and inexact doubly nonnegative relaxations, New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions, Continuous quadratic programming formulations of optimization problems on graphs, Using SVM to combine global heuristics for the standard quadratic problem, A Motzkin-Straus type result for 3-uniform hypergraphs, Fixed interval scheduling: models, applications, computational complexity and algorithms, Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph, Unnamed Item, Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation, Sparse solutions to random standard quadratic optimization problems, A gradient-based approach for discrete optimum design, On Motzkin-Straus type results for non-uniform hypergraphs, Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint, A General Regularized Continuous Formulation for the Maximum Clique Problem, Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems, A new trust region technique for the maximum weight clique problem, On graph-Lagrangians of hypergraphs containing dense subgraphs, On the largest graph-Lagrangian of 3-graphs with fixed number of edges, New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability, On sparsity of the solution to a random quadratic optimization problem, The fundamental theorem of linear programming: extensions and applications, On a polynomial fractional formulation for independence number of a graph, Solving Quadratic Programming by Cutting Planes, Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations, On Lagrangians of \(r\)-uniform hypergraphs, The convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problems, Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma, A new branch-and-bound algorithm for standard quadratic programming problems, An axiomatic duality framework for the theta body and related convex corners, A clique algorithm for standard quadratic programming, A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs, A continuous characterization of the maximum vertex-weighted clique in hypergraphs, A nonconvex quadratic optimization approach to the maximum edge weight clique problem, A tutorial on branch and cut algorithms for the maximum stable set problem, Improving an upper bound on the stability number of a graph, An exact bit-parallel algorithm for the maximum clique problem, Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems, Indirect unstructured hex-dominant mesh generation using tetrahedra recombination, Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions, Some Motzkin-Straus type results for non-uniform hypergraphs, Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs, A survey on graphs with convex quadratic stability number, A continuous characterization of the maximum-edge biclique problem, Exact bounds on the order of the maximum clique of a graph., Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization, On the maxima of Motzkin-Straus programs and cliques of graphs, A study on sequential minimal optimization methods for standard quadratic problems, Continuous cubic formulations for cluster detection problems in networks, Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming, A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
