New Facets and a Branch-and-Cut Algorithm for the Weighted Clique Problem.
Year of publication: |
2001-01-01
|
---|---|
Authors: | Sørensen, Michael M. |
Institutions: | Institut for Marketing og Organisation, Aarhus Universitet |
Subject: | Mathematical analysis | Combinatorial optimization | Boolean quadratic problem | Edge-weighted clique problem | Maximum dispersion problem | Polyhedra |
-
Enumeration of the facets of cut polytopes over some highly symmetric graphs
Deza, Michel, (2016)
-
An unconstrained approach for solving low rank SDP relaxations of {-1,1} quadratic problems
Grippo, Luigi, (2009)
-
Aleksandrov, Aleksandr D., (1958)
- More ...
-
Facet Defining Inequalities for the Simple Graph Partitioning Polytope.
Sørensen, Michael M., (2000)
-
b-Tree Facets for the Simple Graph Partitioning Polytope.
Sørensen, Michael M., (2000)
-
A Note on Clique-Web Facets for Multicut Polytopes
Sørensen, Michael M., (2002)
- More ...