QUALEX

swMATH4742MaRDI QIDQ16910FDOQ16910

Author name not available (Why is that?)

Cited In (54)

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

This page was built for software: QUALEX