Pages that link to "Item:Q1359100"

The following pages link to Evolution towards the maximum clique (Q1359100):

Displaying 47 items.

• Maximum weighted induced subgraphs (Q279221) (← links)
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
• An improved algorithm to test copositivity (Q427387) (← links)
• The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
• On graph-Lagrangians of hypergraphs containing dense subgraphs (Q467466) (← links)
• On the largest graph-Lagrangian of 3-graphs with fixed number of edges (Q467468) (← links)
• Tag SNP selection based on clustering according to dominant sets found using replicator dynamics (Q481938) (← links)
• On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds (Q537652) (← links)
• An exact bit-parallel algorithm for the maximum clique problem (Q709206) (← links)
• A continuous characterization of the maximum-edge biclique problem (Q742133) (← links)
• An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
• A simpler characterization of a spectral lower bound on the clique number (Q966428) (← links)
• A generalization of the Motzkin-Straus theorem to hypergraphs (Q1024737) (← links)
• Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds (Q1029281) (← links)
• Annealed replication: A new heuristic for the maximum clique problem (Q1613385) (← links)
• Maximum cliques of hypergraphs and polynomial optimization (Q1617049) (← links)
• Computation of sparse and dense equilibrium strategies of evolutionary games (Q1630457) (← links)
• A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem (Q1734301) (← links)
• A continuous characterization of the maximum vertex-weighted clique in hypergraphs (Q1752628) (← links)
• Dominant-set clustering: a review (Q1754006) (← links)
• A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
• Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
• Exact bounds on the order of the maximum clique of a graph. (Q1811073) (← links)
• Unconstrained formulation of standard quadratic optimization problems (Q1935878) (← links)
• A modified simplex partition algorithm to test copositivity (Q2052385) (← links)
• Does moral play equilibrate? (Q2061108) (← links)
• On the maxima of Motzkin-Straus programs and cliques of graphs (Q2089888) (← links)
• Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
• Avoiding bad steps in Frank-Wolfe variants (Q2111475) (← links)
• Two methods for the maximization of homogeneous polynomials over the simplex (Q2231046) (← links)
• Frank-Wolfe and friends: a journey into projection-free first-order optimization methods (Q2240671) (← links)
• Metastability in stochastic replicator dynamics (Q2280198) (← links)
• On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
• A Motzkin-Straus type result for 3-uniform hypergraphs (Q2376079) (← links)
• On a continuous approach for the maximum weighted clique problem (Q2392119) (← links)
• Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation (Q2401518) (← links)
• On Motzkin-Straus type results for non-uniform hypergraphs (Q2410100) (← links)
• On a polynomial fractional formulation for independence number of a graph (Q2457911) (← links)
• On the on-line rent-or-buy problem in probabilistic environments (Q2460108) (← links)
• A convergent decomposition algorithm for support vector machines (Q2475612) (← links)
• Quartic formulation of standard quadratic optimization problems (Q2576445) (← links)
• Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
• Using SVM to combine global heuristics for the standard quadratic problem (Q2629704) (← links)
• Equilibrium Distributions of Populations of Biological Species on Networks of Social Sites (Q3304326) (← links)
• A spinorial formulation of the maximum clique problem of a graph (Q3441737) (← links)
• (Q4968665) (← links)
• A General Regularized Continuous Formulation for the Maximum Clique Problem (Q5108235) (← links)