scientific article; zbMATH DE number 26478
From MaRDI portal
Publication:3983239
Recommendations
Cited in
(15)- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- A linear programming formulation for the maximum complete multipartite subgraph problem
- On a max-min problem concerning weights of edges
- On graphs with polynomially solvable maximum-weight clique problem
- A cutting-plane approach to the edge-weighted maximal clique problem
- Maximum weighted edge biclique problem on bipartite graphs
- scientific article; zbMATH DE number 7764108 (Why is no real title available?)
- A new family of facet defining inequalities for the maximum edge-weighted clique problem
- The maximum clique problem in multiple interval graphs
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- An extended formulation approach to the edge-weighted maximal clique problem
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
- On bipartite and multipartite clique problems
- The clique problem with multiple-choice constraints under a cycle-free dependency graph
- Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3983239)
