Pages that link to "Item:Q5905591"

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

Displaying 42 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)
• 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)
• 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 combinatorial column generation algorithm for the maximum stable set problem (Q1374381) (← links)
• One-pass heuristics for large-scale unconstrained binary quadratic problems (Q1600836) (← links)
• Large-scale mining co-expressed genes in \textit{Arabidopsis} anther: from pair to group (Q1629368) (← links)
• Exact algorithms for maximum clique: a computational study (Q1736530) (← 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 continuation approach for solving binary quadratic program based on a class of NCP-functions (Q2344687) (← 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 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)
• 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)
• Global equilibrium search applied to the unconstrained binary quadratic optimization problem (Q5459821) (← links)
• (Q5869388) (← links)
• A quadratic programming approach to the determination of an upper bound on the weighted stability number (Q5939588) (← links)
• Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem (Q5945202) (← links)
• A unified pre-training and adaptation framework for combinatorial optimization on graphs (Q6564775) (← links)