Pages that link to "Item:Q2433799"

The following pages link to A new trust region technique for the maximum weight clique problem (Q2433799):

Displaying 42 items.

• A linear-time algorithm for trust region problems (Q304248) (← links)
• Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
• Permutation codes with specified packing radius (Q356723) (← links)
• An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← 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)
• On Lagrangians of \(r\)-uniform hypergraphs (Q498456) (← links)
• Finding quasi core with simulated stacked neural networks (Q526647) (← links)
• An exact bit-parallel algorithm for the maximum clique problem (Q709206) (← links)
• Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
• Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
• A generalization of the Motzkin-Straus theorem to hypergraphs (Q1024737) (← links)
• Maximum cliques of hypergraphs and polynomial optimization (Q1617049) (← links)
• A continuous characterization of the maximum vertex-weighted clique in hypergraphs (Q1752628) (← links)
• PUSH: A generalized operator for the maximum vertex weight clique problem (Q1752768) (← links)
• A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
• Multi-neighborhood tabu search for the maximum weight clique problem (Q1761843) (← links)
• Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← 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)
• SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
• Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135) (← links)
• Phased local search for the maximum clique problem (Q2369988) (← links)
• A Motzkin-Straus type result for 3-uniform hypergraphs (Q2376079) (← links)
• On a continuous approach for the maximum weighted clique problem (Q2392119) (← links)
• On Motzkin-Straus type results for non-uniform hypergraphs (Q2410100) (← links)
• A simple simulated annealing algorithm for the maximum clique problem (Q2456476) (← links)
• A hybrid heuristic for the maximum clique problem (Q2491328) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
• Exact solution of graph coloring problems via constraint programming and column generation (Q2815431) (← links)
• Approximate dynamic programming based on high dimensional model representation (Q2868781) (← links)
• A Max-SAT Inference-Based Pre-processing for Max-Clique (Q3502702) (← links)
• Continuous Characterizations of the Maximum Clique Problem (Q4361794) (← links)
• A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
• On cliques and Lagrangians of hypergraphs (Q4968665) (← links)
• Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices (Q5009509) (← links)
• A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← 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)