|
Camargue
|
|
Camargue
|
| CCMR::LP::ActiveTour | Information about the active tour in a CoreLP |
| CCMR::Graph::AdjList | Representation of a graph as an adjacency list |
| CCMR::Graph::AdjObj | Object used to represent adjacency in a Graph::AdjList |
| ▼CCMR::ABC::BaseBrancher | Abstract base class for implementing a branching node selection rule |
| CCMR::ABC::DFSbrancher | Depth-first search branching |
| CCMR::ABC::InterBrancher | Interleaved best-estimate and best-first search branching |
| CCMR::ABC::QprefBrancher< q_pref > | Class template for branching with priority queue via some preference rule |
| CCMR::LP::Basis | Row and column basic statuses corresponding to some LP solution |
| CCMR::Data::BestGroup | Information about the current best tour |
| CCMR::ABC::BranchNode | |
| CCMR::ABC::BranchTourFind | Compute branch tours for estimation and instatement, managing their edges |
| CCMR::util::C_resource_deleter< T > | Class template for deleting resources allocated by C functions |
| CCMR::Sep::CandidateTeeth | |
| ▼CCMR::Sep::CCsepBase | Abstract base class for calling Concorde separation routines |
| CCMR::Sep::ConcordeSeparator< sep_fn, check_filter_primal, fn_name > | Class template for straightforward Concorde separation routines |
| CCMR::Sep::LocalCuts | Primal separation of non-template local cuts via standard heuristics |
| CCMR::Sep::PoolCuts | Cut pool separation |
| CCMR::Sep::Clique | Class for storing segment lists representing edges of a hypergraph |
| CCMR::Sep::CliqueBank | Storage of a repository of Cliques, for use in building a HyperGraph |
| CCMR::Graph::CoreGraph | Graph structures for the edges currently in a CoreLP::Relaxation |
| CCMR::LP::CPXparamGuard< numtype, GetP, SetP > | A scope guard for making temporary changes to a CPLEX parameter |
| CCMR::Sep::CutQueue< cut_rep > | Class template for queue of cuts in some form |
| CCMR::Sep::CutQueue< CC_GHnode * > | |
| CCMR::Sep::CutQueue< CMR::Sep::dominoparity > | |
| CCMR::Sep::CutQueue< CMR::Sep::ex_blossom > | |
| CCMR::Sep::CutQueue< LP::CMR::LP::SparseRow > | |
| CCMR::Solver::CutSel | Which separation routines should be called |
| CCMR::Sep::dominoparity | Structure for storing simple DP inequalities |
| CCMR::Sep::DPwitness | Class for building miniature simple DP witness cutgraphs |
| CCMR::LP::DualGroup< numtype > | Class template for storing dual LP solutions |
| CCMR::Price::Pricer::edgegen_impl | |
| CCMR::util::EdgeHash | Hash map for node pairs representing edges |
| CCMR::util::EdgeHash::eh_impl | |
| ▼CCMR::EndPts | Simple base class for storing edge of a graph as a sorted pair of nodes |
| CCMR::Graph::Edge | Representing graph edges and costs |
| CCMR::Price::PrEdge< numtype > | |
| CCMR::LP::Estimate | Struct for storing info from branching estimates |
| CCMR::Sep::ex_blossom | Structure for storing blossom inequalities from exact primal separation |
| CCMR::Sep::ExBlossoms | Exact primal blossom separation as per Letchford and Lodi's algorithm |
| CCMR::ABC::Executor | |
| CCMR::Sep::ExternalCuts | The external storage of a collection of HyperGraph cuts in a Relaxation |
| CCMR::util::Fixed64 | A 64-bit fixed precision number type "implemented" as a wrapper to CCbigguy |
| Cstd::hash< CMR::Sep::Clique > | Partial specialization of std::hash taken from CCtsp_hashclique |
| Cstd::hash< CMR::Sep::Tooth > | Partial specialization of std::hash from CCtsp_hashdomino |
| CCMR::Sep::LPcutList::hungry_delete | Deleter to clear the linked list |
| CCMR::Sep::HyperGraph | External representation of a cut added to the lp relaxation |
| CCMR::Data::Instance | Storing TSP instance data |
| CCMR::Data::KarpPartition | Class for computing and storing Karp partitions |
| CCMR::Sep::CandidateTeeth::LinsubCBData | |
| CCMR::Sep::LPcutList | Management of Concorde lpcut_in linked list |
| CCMR::Sep::MetaCuts | Separation of cut metamorphoses |
| CCMR::Sep::MIRgroup | Memory-managed access to classes needed during safe GMI separation |
| CCMR::LP::NDpivotHandle | Handle for data during a non-degenerate pivot callback |
| CCMR::Graph::Node | A vertex in a Graph::AdjList graph |
| COptData | Data grabbed from the user at the command line |
| CCMR::OutPrefs | Preferences related to tour file output and verbosity |
| CCMR::Solver::PivStats | Tracking objective values of pivots within a cut_and_piv loop |
| CCMR::Price::Pricer | Get reduced costs for edges not in the core lp |
| ▼CCMR::LP::Relaxation | Class for storing an lp relaxation via interface to an lp solver |
| CCMR::LP::CoreLP | Class for storing the core lp associated to a TSP instance and pivoting |
| ▼Cruntime_error | |
| CCMR::util::retcode_error | Structure for converting retcodes to exceptions |
| CCMR::Sep::SafeGomory | Primal separation of safe Gomory cuts |
| CCMR::util::ScopeGuard< act_type > | Code from Andrei Alexandrescu's ScopeGuard11 slides |
| CCMR::ABC::ScoreTuple | |
| ▼CCMR::Segment | Simple utility struct for storing an interval of nodes |
| CCMR::Sep::ToothBody | Representing bodies of simple tooth inequalities with associated slack |
| CCMR::Sep::Separator | Management of basic separation routines |
| CCMR::Sep::SimpleDP | Separating primal simple domino parity inequalities |
| CCMR::Sep::SimpleTooth | Representing simple tooth inequalities |
| CCMR::Solver | Solution of TSP instances |
| CCMR::LP::Relaxation::solver_impl | |
| CCMR::LP::SparseRow | Simple struct representing sparse matrix row for passing to LP solver |
| CCMR::util::SquareUT< T > | Class template for a square upper triangular matrix |
| CCMR::Data::SupportGroup | Support graph data for an LP solution |
| CCMR::Sep::SystemDeleter | Deleter for constraint matrix system |
| CCMR::Timer | A class for recording CPU and wall clock time |
| CCMR::Sep::Tooth | Vertex set structure used in tooth inequalities for domino parity cuts |
| CCMR::Sep::ToothBank | Storage of a repository of Teeth, for use in building a HyperGraph |
| CCMR::Sep::TourGraph | Wrapper to Concorde CCtsp_lpgraph for pricing cuts at tours |
| CCMR::Sep::VinfoDeleter |
1.8.11
