Pages that link to "Item:Q3983239"
From MaRDI portal
The following pages link to The maximum edge-weighted clique problem in complete multipartite graphs (Q3983239):
Displaying 15 items.
- Maximum weighted edge biclique problem on bipartite graphs (Q779184) (← links)
- An extended formulation approach to the edge-weighted maximal clique problem (Q1278438) (← links)
- A cutting-plane approach to the edge-weighted maximal clique problem (Q1309944) (← links)
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations (Q1569939) (← links)
- Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph (Q2097180) (← links)
- The clique problem with multiple-choice constraints under a cycle-free dependency graph (Q2192065) (← links)
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations (Q2260912) (← links)
- The maximum clique problem in multiple interval graphs (Q2350898) (← links)
- A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127) (← links)
- A linear programming formulation for the maximum complete multipartite subgraph problem (Q2583129) (← links)
- On bipartite and multipartite clique problems (Q2775896) (← links)
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
- On graphs with polynomially solvable maximum-weight clique problem (Q3809822) (← links)
- On a max-min problem concerning weights of edges (Q5955207) (← links)
- (Q6068263) (← links)