QUALEX

swMATH4742MaRDI QIDQ16910

No author found.

Related Items (54)

Subgraph extraction and metaheuristics for the maximum clique problem ⋮ Maximum cliques of hypergraphs and polynomial optimization ⋮ Phased local search for the maximum clique problem ⋮ A review on algorithms for maximum clique problems ⋮ A linear-time algorithm for trust region problems ⋮ Solving the maximum vertex weight clique problem via binary quadratic programming ⋮ A Motzkin-Straus type result for 3-uniform hypergraphs ⋮ Unnamed Item ⋮ On a continuous approach for the maximum weighted clique problem ⋮ An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network ⋮ Unnamed Item ⋮ Permutation codes with specified packing radius ⋮ An adaptive multistart tabu search approach to solve the maximum clique problem ⋮ Semidefinite bounds for the stability number of a graph via sums of squares of polynomials ⋮ The stable set problem: clique and nodal inequalities revisited ⋮ On Motzkin-Straus type results for non-uniform hypergraphs ⋮ Unnamed Item ⋮ Maximum-weight stable sets and safe lower bounds for graph coloring ⋮ A new trust region technique for the maximum weight clique problem ⋮ Combinatorial algorithms for the maximum \(k\)-plex problem ⋮ Local search with edge weighting and configuration checking heuristics for minimum vertex cover ⋮ On graph-Lagrangians of hypergraphs containing dense subgraphs ⋮ On the largest graph-Lagrangian of 3-graphs with fixed number of edges ⋮ A simple simulated annealing algorithm for the maximum clique problem ⋮ On a polynomial fractional formulation for independence number of a graph ⋮ Unnamed Item ⋮ Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices ⋮ On Lagrangians of \(r\)-uniform hypergraphs ⋮ A continuous characterization of the maximum vertex-weighted clique in hypergraphs ⋮ PUSH: A generalized operator for the maximum vertex weight clique problem ⋮ Approximate Dynamic Programming based on High Dimensional Model Representation ⋮ Finding quasi core with simulated stacked neural networks ⋮ 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 ⋮ Multi-neighborhood tabu search for the maximum weight clique problem ⋮ A hybrid heuristic for the maximum clique problem ⋮ On solving trust-region and other regularised subproblems in optimization ⋮ Experimental analysis of approximation algorithms for the vertex cover and set covering problems ⋮ A novel evolutionary formulation of the maximum independent set problem ⋮ Indirect unstructured hex-dominant mesh generation using tetrahedra recombination ⋮ Some Motzkin-Straus type results for non-uniform hypergraphs ⋮ Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs ⋮ Simple ingredients leading to very efficient heuristics for the maximum clique problem ⋮ Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation ⋮ Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers ⋮ SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem ⋮ Principles and Practice of Constraint Programming – CP 2003 ⋮ A generalization of the Motzkin-Straus theorem to hypergraphs ⋮ On the maxima of Motzkin-Straus programs and cliques of graphs ⋮ Novel approaches for analyzing biological networks ⋮ Continuous cubic formulations for cluster detection problems in networks ⋮ A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem ⋮ Payoff-Monotonic Game Dynamics and the Maximum Clique Problem ⋮ A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere

This page was built for software: QUALEX