Pages that link to "Item:Q1278438"

The following pages link to An extended formulation approach to the edge-weighted maximal clique problem (Q1278438):

Displaying 26 items.

• 2-approximation algorithm for finding a clique with minimum weight of vertices and edges (Q483409) (← links)
• Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph (Q492279) (← links)
• Upper bounds and heuristics for the 2-club problem (Q541693) (← links)
• The quadratic knapsack problem -- a survey (Q875597) (← links)
• New facets and a branch-and-cut algorithm for the weighted clique problem. (Q1420411) (← links)
• The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations (Q1569939) (← links)
• An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
• Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph (Q1751163) (← links)
• A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
• An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041) (← links)
• Solving the maximum edge-weight clique problem in sparse graphs with compact formulations (Q2260912) (← links)
• Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm (Q2345653) (← links)
• Quadratic bottleneck knapsack problems (Q2359152) (← links)
• A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127) (← links)
• The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem (Q2370343) (← links)
• A polyhedral approach for a constrained quadratic 0-1 problem (Q2387431) (← links)
• A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• Tightening concise linear reformulations of 0-1 cubic programs (Q2810099) (← links)
• A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
• Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
• Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
• On the Approximability of the Minimum Weight $t$-partite Clique Problem (Q5119375) (← links)
• Disconnecting graphs by removing vertices: a polyhedral approach (Q5422013) (← links)
• A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)