Declaration of an initial constraint class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem. More...
#include <ogdf/internal/cluster/Cluster_EdgeVar.h>#include <ogdf/internal/cluster/MaxCPlanar_Master.h>#include <abacus/constraint.h>Go to the source code of this file.
Classes | |
| class | ogdf::MinimalClusterConnection |
Namespaces | |
| namespace | ogdf |
| The namespace for all OGDF objects. | |
Declaration of an initial constraint class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem.
If some cluster has no connection to some other cluster, the optimal solution might insert a new connection-edge between theese two clusters, to obtain connectivity. Since the objective function minimizes the number of new connection-edges, at most one new egde will be inserted between two clusters that are not connected. This behaviour of the LP-solution is guaranteed from the beginning, by creating an initial constraint for each pair of non-connected clusters, which is implemented by this constraint class.
Copyright (C). All rights reserved. See README.txt in the root directory of the OGDF installation for details.
Definition in file MaxCPlanar_MinimalClusterConnection.h.