Evolution towards the maximum clique
From MaRDI portal
Publication:1359100
DOI10.1023/A:1008230200610zbMath0880.90110OpenAlexW1546734293MaRDI QIDQ1359100
Publication date: 24 June 1997
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008230200610
global optimizationreplicator dynamicsNP-hardsimulation studyevolutionary game theorymaximum cliqueindefinite quadratic programming
Related Items (55)
Annealed replication: A new heuristic for the maximum clique problem ⋮ On characterization of maximal independent sets via quadratic optimization ⋮ Maximum cliques of hypergraphs and polynomial optimization ⋮ Maximum weighted induced subgraphs ⋮ A spinorial formulation of the maximum clique problem of a graph ⋮ Computation of sparse and dense equilibrium strategies of evolutionary games ⋮ 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 ⋮ Fast Cluster Detection in Networks by First Order Optimization ⋮ On a continuous approach for the maximum weighted clique problem ⋮ 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 ⋮ On Motzkin-Straus type results for non-uniform hypergraphs ⋮ Unconstrained formulation of standard quadratic optimization problems ⋮ A General Regularized Continuous Formulation for the Maximum Clique Problem ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ An improved algorithm to test copositivity ⋮ The 2-coordinate descent method for solving double-sided simplex constrained minimization problems ⋮ On graph-Lagrangians of hypergraphs containing dense subgraphs ⋮ On the largest graph-Lagrangian of 3-graphs with fixed number of edges ⋮ Tag SNP selection based on clustering according to dominant sets found using replicator dynamics ⋮ On a polynomial fractional formulation for independence number of a graph ⋮ A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem ⋮ Two methods for the maximization of homogeneous polynomials over the simplex ⋮ On the on-line rent-or-buy problem in probabilistic environments ⋮ Equilibrium Distributions of Populations of Biological Species on Networks of Social Sites ⋮ Frank-Wolfe and friends: a journey into projection-free first-order optimization methods ⋮ Neural networks for NP-complete problems ⋮ Constructing test functions for global optimization using continuous formulations of graph problems ⋮ A continuous characterization of the maximum vertex-weighted clique in hypergraphs ⋮ A convergent decomposition algorithm for support vector machines ⋮ Dominant-set clustering: a review ⋮ A nonconvex quadratic optimization approach to the maximum edge weight clique problem ⋮ On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds ⋮ A simpler characterization of a spectral lower bound on the clique number ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ An exact bit-parallel algorithm for the maximum clique problem ⋮ Metastability in stochastic replicator dynamics ⋮ 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 continuous characterization of the maximum-edge biclique problem ⋮ A modified simplex partition algorithm to test copositivity ⋮ Exact bounds on the order of the maximum clique of a graph. ⋮ Does moral play equilibrate? ⋮ A generalization of the Motzkin-Straus theorem to hypergraphs ⋮ Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds ⋮ Hessian Barrier Algorithms for Linearly Constrained Optimization Problems ⋮ An active-set algorithmic framework for non-convex optimization problems over the simplex ⋮ On the maxima of Motzkin-Straus programs and cliques of graphs ⋮ Quartic formulation of standard quadratic optimization problems ⋮ Continuous cubic formulations for cluster detection problems in networks ⋮ A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem ⋮ Avoiding bad steps in Frank-Wolfe variants
This page was built for publication: Evolution towards the maximum clique
