Pages that link to "Item:Q1569939"

The following pages link to The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations (Q1569939):

Displaying 27 items.

• Breakout local search for maximum clique problems (Q339563) (← links)
• Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
• Upper bounds and heuristics for the 2-club problem (Q541693) (← links)
• Solving the maximum edge weight clique problem via unconstrained quadratic programming (Q877032) (← links)
• Approximating the maximum vertex/edge weighted clique using local search (Q1009183) (← links)
• New facets and a branch-and-cut algorithm for the weighted clique problem. (Q1420411) (← links)
• A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
• Exact and heuristic algorithms for the weighted total domination problem (Q2027027) (← links)
• \(t\)-linearization for the maximum diversity problem (Q2230803) (← 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 hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← 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)
• Iterated tabu search for the maximum diversity problem (Q2381330) (← links)
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← 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 two-phase tabu search based evolutionary algorithm for the maximum diversity problem (Q2673240) (← links)
• The bipartite Boolean quadric polytope (Q2673249) (← links)
• An Exact Decomposition Approach for the Real-Time Train Dispatching Problem (Q3195230) (← 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)
• Convex Optimization for Group Feature Selection in Networked Data (Q5139860) (← links)
• Disconnecting graphs by removing vertices: a polyhedral approach (Q5422013) (← links)
• A note on characterizing canonical cuts using geometry (Q5449873) (← links)
• A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)