| ▼NCMR | The namespace for this project |
| ▼NABC | Augment-Branch-Cut solution |
| CBaseBrancher | Abstract base class for implementing a branching node selection rule |
| CBranchNode | |
| CBranchTourFind | Compute branch tours for estimation and instatement, managing their edges |
| CDFSbrancher | Depth-first search branching |
| CExecutor | |
| CInterBrancher | Interleaved best-estimate and best-first search branching |
| CQprefBrancher | Class template for branching with priority queue via some preference rule |
| CScoreTuple | |
| ▼NData | Data group namespace |
| CBestGroup | Information about the current best tour |
| CInstance | Storing TSP instance data |
| CKarpPartition | Class for computing and storing Karp partitions |
| CSupportGroup | Support graph data for an LP solution |
| ▼NGraph | Classes and functions for working with graphs |
| CAdjList | Representation of a graph as an adjacency list |
| CAdjObj | Object used to represent adjacency in a Graph::AdjList |
| CCoreGraph | Graph structures for the edges currently in a CoreLP::Relaxation |
| CEdge | Representing graph edges and costs |
| CNode | A vertex in a Graph::AdjList graph |
| ▼NLP | Manners related to LP relaxations and solver interfaces |
| CActiveTour | Information about the active tour in a CoreLP |
| CBasis | Row and column basic statuses corresponding to some LP solution |
| CCoreLP | Class for storing the core lp associated to a TSP instance and pivoting |
| CCPXparamGuard | A scope guard for making temporary changes to a CPLEX parameter |
| CDualGroup | Class template for storing dual LP solutions |
| CEstimate | Struct for storing info from branching estimates |
| CNDpivotHandle | Handle for data during a non-degenerate pivot callback |
| ▼CRelaxation | Class for storing an lp relaxation via interface to an lp solver |
| Csolver_impl | |
| CSparseRow | Simple struct representing sparse matrix row for passing to LP solver |
| ▼NPrice | Matters related to pricing sets of edges |
| CPrEdge | |
| ▼CPricer | Get reduced costs for edges not in the core lp |
| Cedgegen_impl | |
| ▼NSep | Classes and functions related to cut separation |
| ▼CCandidateTeeth | |
| CLinsubCBData | |
| CCCsepBase | Abstract base class for calling Concorde separation routines |
| CClique | Class for storing segment lists representing edges of a hypergraph |
| CCliqueBank | Storage of a repository of Cliques, for use in building a HyperGraph |
| CConcordeSeparator | Class template for straightforward Concorde separation routines |
| CCutQueue | Class template for queue of cuts in some form |
| Cdominoparity | Structure for storing simple DP inequalities |
| CDPwitness | Class for building miniature simple DP witness cutgraphs |
| Cex_blossom | Structure for storing blossom inequalities from exact primal separation |
| CExBlossoms | Exact primal blossom separation as per Letchford and Lodi's algorithm |
| CExternalCuts | The external storage of a collection of HyperGraph cuts in a Relaxation |
| CHyperGraph | External representation of a cut added to the lp relaxation |
| CLocalCuts | Primal separation of non-template local cuts via standard heuristics |
| ▼CLPcutList | Management of Concorde lpcut_in linked list |
| Chungry_delete | Deleter to clear the linked list |
| CMetaCuts | Separation of cut metamorphoses |
| CMIRgroup | Memory-managed access to classes needed during safe GMI separation |
| CPoolCuts | Cut pool separation |
| CSafeGomory | Primal separation of safe Gomory cuts |
| CSeparator | Management of basic separation routines |
| CSimpleDP | Separating primal simple domino parity inequalities |
| CSimpleTooth | Representing simple tooth inequalities |
| CSystemDeleter | Deleter for constraint matrix system |
| CTooth | Vertex set structure used in tooth inequalities for domino parity cuts |
| CToothBank | Storage of a repository of Teeth, for use in building a HyperGraph |
| CToothBody | Representing bodies of simple tooth inequalities with associated slack |
| CTourGraph | Wrapper to Concorde CCtsp_lpgraph for pricing cuts at tours |
| CVinfoDeleter | |
| ▼Nutil | Utility functions/structures used miscellaneous places in the project |
| CC_resource_deleter | Class template for deleting resources allocated by C functions |
| ▼CEdgeHash | Hash map for node pairs representing edges |
| Ceh_impl | |
| CFixed64 | A 64-bit fixed precision number type "implemented" as a wrapper to CCbigguy |
| Cretcode_error | Structure for converting retcodes to exceptions |
| CScopeGuard | Code from Andrei Alexandrescu's ScopeGuard11 slides |
| CSquareUT | Class template for a square upper triangular matrix |
| CEndPts | Simple base class for storing edge of a graph as a sorted pair of nodes |
| COutPrefs | Preferences related to tour file output and verbosity |
| CSegment | Simple utility struct for storing an interval of nodes |
| ▼CSolver | Solution of TSP instances |
| CCutSel | Which separation routines should be called |
| CPivStats | Tracking objective values of pivots within a cut_and_piv loop |
| CTimer | A class for recording CPU and wall clock time |
| ▼Nstd | |
| Chash< CMR::Sep::Clique > | Partial specialization of std::hash taken from CCtsp_hashclique |
| Chash< CMR::Sep::Tooth > | Partial specialization of std::hash from CCtsp_hashdomino |
| COptData | Data grabbed from the user at the command line |
1.8.11
