Pages that link to "Item:Q1420411"

The following pages link to New facets and a branch-and-cut algorithm for the weighted clique problem. (Q1420411):

Displaying 23 items.

• When centers can fail: a close second opportunity (Q337641) (← links)
• The table placement problem: a research challenge at the EWI 2007 (Q458951) (← links)
• Upper bounds and heuristics for the 2-club problem (Q541693) (← links)
• A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← links)
• Solving the maximum edge weight clique problem via unconstrained quadratic programming (Q877032) (← links)
• The sport teams grouping problem (Q1730756) (← links)
• A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
• New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem (Q1926700) (← links)
• Branch-and-price for \(p\)-cluster editing (Q2013143) (← links)
• Multilinear sets with two monomials and cardinality constraints (Q2097167) (← links)
• Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances (Q2163779) (← links)
• An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (Q2255969) (← links)
• Solving the maximum edge-weight clique problem in sparse graphs with compact formulations (Q2260912) (← links)
• A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
• A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127) (← links)
• Iterated tabu search for the maximum diversity problem (Q2381330) (← links)
• A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766) (← links)
• Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
• The Boolean Quadric Polytope (Q5050144) (← links)
• On the Approximability of the Minimum Weight $t$-partite Clique Problem (Q5119375) (← links)
• Disconnecting graphs by removing vertices: a polyhedral approach (Q5422013) (← links)