Pages that link to "Item:Q4009762"
From MaRDI portal
The following pages link to A global optimization approach for solving the maximum clique problem (Q4009762):
Displaying 32 items.
- On graph-Lagrangians of hypergraphs containing dense subgraphs (Q467466) (← links)
- On Lagrangians of \(r\)-uniform hypergraphs (Q498456) (← links)
- A generalization of the Motzkin-Straus theorem to hypergraphs (Q1024737) (← links)
- The maximum clique problem (Q1318271) (← links)
- Annealed replication: A new heuristic for the maximum clique problem (Q1613385) (← links)
- Maximum cliques of hypergraphs and polynomial optimization (Q1617049) (← 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)
- Exact bounds on the order of the maximum clique of a graph. (Q1811073) (← links)
- Modelling competitive Hopfield networks for the maximum clique problem (Q1870811) (← links)
- A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees (Q1907945) (← links)
- A sublevel moment-SOS hierarchy for polynomial optimization (Q2070330) (← 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)
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) (← links)
- Solving the maximum clique problem using a tabu search approach (Q2367014) (← links)
- A Motzkin-Straus type result for 3-uniform hypergraphs (Q2376079) (← 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)
- Genetic algorithmic approach to find the maximum weight independent set of a graph (Q2471331) (← links)
- Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
- An algorithm for finding a maximum weighted independent set in an arbitrary graph (Q3210915) (← links)
- A spinorial formulation of the maximum clique problem of a graph (Q3441737) (← links)
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems (Q4286574) (← links)
- An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning (Q4816960) (← links)
- A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
- On cliques and Lagrangians of hypergraphs (Q4968665) (← links)
- A General Regularized Continuous Formulation for the Maximum Clique Problem (Q5108235) (← links)
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)
- Some Motzkin-Straus type results for non-uniform hypergraphs (Q5963619) (← links)
- Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs (Q5963658) (← links)