Pages that link to "Item:Q1309944"
From MaRDI portal
The following pages link to A cutting-plane approach to the edge-weighted maximal clique problem (Q1309944):
Displaying 21 items.
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- An extended formulation approach to the edge-weighted maximal clique problem (Q1278438) (← 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)
- Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts'' (Q1634803) (← links)
- An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
- PUSH: A generalized operator for the maximum vertex weight clique problem (Q1752768) (← links)
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems (Q1904710) (← 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)
- A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127) (← 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)
- Maximum cut-clique problem: ILS heuristics and a data analysis application (Q2806429) (← links)
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
- The maximum edge-weighted clique problem in complete multipartite graphs (Q3983239) (← 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)