File List

Here is a list of all documented files with brief descriptions:

[detail level 12]

▼ includes
abc_nodesel.hpp	Classes for node selection rules
active_tour.hpp	Monitoring the active tour in the solution process
base_brancher.hpp	Abstract branching control
blossoms.hpp	Exact primal blossom separation
branch_node.hpp	ABC search nodes
branch_tour.hpp	Working with branch tours
branch_util.hpp	Functions, structs/enums, and constants for branching
cc_lpcuts.hpp	Wrappers for Concorde cut structures/separators
cliq.hpp	Reference counted storage of Cliques and Tooth objects
config.hpp	Configuration macros
core_lp.hpp	Managing Core LP relaxations of TSP instances
cut_structs.hpp
datagroups.hpp	Data group structures
dualgroup.hpp	LP dual solutions
edgehash.hpp	Hash map for graph edges
err_util.hpp	ERROR HANDLING CLASSES AND ROUTINES
exec_branch.hpp	Branching execution
fixed64.hpp	Wrapper/arithmetic operators for fixed precision arithmetic
graph.hpp	Header for classes/structures/functions to work with graphs
hypergraph.hpp	Representing cuts outside the LP solver
io_util.hpp	Utilities for reading and writing to files
karp.hpp	Karp partitions of TSP instances
lp_interface.hpp	Interface to the LP solver
lp_util.hpp	Miscellaneous functions, structs/enums, and constants for LPs
meta_sep.hpp	Separating with cut metamorphoses
mirgroup.hpp	Utility structures for running safe Gomory cut separation
pool_sep.hpp	Separating over a pool of cuts
price_util.hpp	Constants and functions related to edge pricing
pricer.hpp	Pricing sets of edges
process_cuts.hpp	Structures for storing and processing cuts
qpref_brancher.hpp	Template classes/methods for branching by priority queue
safeGMI.hpp	Primal safe Gomory cut separation
separator.hpp	Some straightforward separation routines
simpleDP.hpp	Primal light simple DP separation
solver.hpp	TSP Solver class header
timer.hpp
tooth.hpp
util.hpp	Utility functions, macros, and structures
witness.hpp
▼ source
camargue.cpp	The camargue main program
price_exact.cpp	Pricer implementations for exact lower bounds/edge elimination
price_gen.cpp	Pricer implementations for generating negative reduced cost edges
price_recover.cpp	Pricer implementations for recovering an infeasible LP
solver.cpp	Implementation of higher level or public Solver methods
solver_loops.cpp	Private Solver methods with loop calls or utility functions