Pages that link to "Item:Q5905591"

The following pages link to A branch and bound algorithm for the maximum clique problem (Q5905591):

Displaying 50 items.

• Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• Finding quasi core with simulated stacked neural networks (Q526647) (← links)
• Indirect unstructured hex-dominant mesh generation using tetrahedra recombination (Q722824) (← links)
• Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
• An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
• Optimization of a quadratic function with a circulant matrix (Q853879) (← links)
• Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636) (← links)
• A global continuation algorithm for solving binary quadratic programming problems (Q1029635) (← links)
• Local minima for indefinite quadratic knapsack problems (Q1186274) (← links)
• An algorithm for finding a maximum clique in a graph (Q1267190) (← links)
• Test case generators and computational results for the maximum clique problem (Q1310979) (← links)
• The maximum clique problem (Q1318271) (← links)
• A multi-KP modeling for the maximum-clique problem (Q1328650) (← links)
• A combinatorial column generation algorithm for the maximum stable set problem (Q1374381) (← links)
• One-pass heuristics for large-scale unconstrained binary quadratic problems (Q1600836) (← links)
• A fast algorithm for the maximum clique problem (Q1613374) (← links)
• Large-scale mining co-expressed genes in \textit{Arabidopsis} anther: from pair to group (Q1629368) (← links)
• On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) (← links)
• On comparing algorithms for the maximum clique problem (Q1671301) (← links)
• Exact algorithms for maximum clique: a computational study (Q1736530) (← links)
• On solving the maximum clique problem (Q1850827) (← links)
• Modelling competitive Hopfield networks for the maximum clique problem (Q1870811) (← links)
• On the minimum number of logical clauses inferred from examples (Q1919787) (← links)
• Diversification strategies in tabu search algorithms for the maximum clique problem (Q1919840) (← links)
• Computing maximum \(k\)-defective cliques in massive graphs (Q2026994) (← links)
• Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound (Q2030442) (← links)
• An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) (← links)
• A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) (← links)
• A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
• A continuation approach for solving binary quadratic program based on a class of NCP-functions (Q2344687) (← links)
• A parallel branch and bound algorithm for the maximum labelled clique problem (Q2355318) (← links)
• Solving the maximum clique problem using a tabu search approach (Q2367014) (← links)
• Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
• Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
• A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs (Q2423295) (← links)
• A simple simulated annealing algorithm for the maximum clique problem (Q2456476) (← links)
• A tight lower bound for a special case of quadratic 0-1 programming (Q2492664) (← links)
• A polyhedral study of the generalized vertex packing problem (Q2492699) (← links)
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming (Q2641083) (← links)
• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
• A pivoting-based heuristic for the maximum clique problem. (Q2768058) (← links)
• Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
• Depth-first simplicial partition for copositivity detection, with an application to MaxClique (Q3093056) (← links)
• An algorithm for finding a maximum weighted independent set in an arbitrary graph (Q3210915) (← 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)
• (Q5203914) (← links)
• A New Branch and Bound Algorithm for the Clique Partitioning Problem (Q5392092) (← links)