|
| | basics.h |
| | Declaration of the master class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem.
|
| |
| | ChunkConnection.h |
| | implementation of initial cut-constraint class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem.
|
| |
| | ClusterKuratowskiConstraint.h |
| | Declaration of a constraint class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem.
|
| |
| | ClusterPQContainer.h |
| | Declaration of ClusterPQContainer.
|
| |
| | CP_MasterBase.h |
| | Declaration of base class for master of Branch&Cut based algorithms for c-planarity testing via an extension to complete connectivity.
|
| |
| | CPlanarEdgeVar.h |
| | Declaration of the variable class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem.
|
| |
| | CPlanarityMaster.h |
| | Declaration of the CPlanarityMaster class for the Branch&Cut algorithm for c-planarity testing via an extension to complete connectivity.
|
| |
| | CPlanaritySub.h |
| | Declaration of the sub-problem class for the Branch&Cut&Price algorithm for the c-planarity problem.
|
| |
| | CPlanarSubClusteredST.h |
| | Declaration of CPlanarSubClusteredST class.
|
| |
| | CutConstraint.h |
| | Declaration of a constraint class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem.
|
| |
| | EdgeVar.h |
| | Declaration of the variable class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem.
|
| |
| | MaxCPlanarMaster.h |
| | Declaration of the master class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem.
|
| |
| | MaxCPlanarSub.h |
| | Declaration of the sub-problem class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem Contains separation algorithms as well as primal heuristics.
|
| |
| | MaxPlanarEdgesConstraint.h |
| | Declaration of a constraint class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem.
|
| |
| | MinimalClusterConnection.h |
| | Declaration of an initial constraint class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem.
|
| |