Here are the classes, structs, unions and interfaces with brief descriptions:

[detail level 123]

▼NCQKnPClass_di_unipi_it
▼CCQKnPClass	The class ContQKsk defines an interface for Continuous Quadratic Knapsack problems (CQKnP) solvers
CCQKException	Small class for exceptions
CInf	Small class using std::numeric_limits to extract the "infinity" value of a basic type (just use Inf<type>())
CDualCQKnP	Solver of Continuous Quadratic Knapsack Problems (CQKnP) based on the standard formulation of the dual problem as a piecewise-convex problem in the unique multiplier of the knapsack constraint and the corresponding obvious dual-ascent approach
CExDualCQKnP	Continuous Quadratic Knapsack Problems (CQKnP) solver derived from the DualCQKnP class (and therefore from CQKnPClass) and extending it, using the same standard dual-ascent approach, to non-negative quadratic costs and extended real bounds
CColorTV	Definition of the class ColorTV
CDeflection	The class Deflection provides an interface for the deflection rule (DR), to be used in the SubGrad solver [see SubGrad.h]
CFiOracle	The class FiOracle provides a standard interface between NDO solvers and the functions that they have to minimize
CFlwFiOrcl	This class instantiates the FiOracle interface [see FiOracle.h] to solve the flow Lagrangian relaxation of the (Fixed-Charge) Multicommodity Min Cost Flow Problem ((FC-)MMCF), possibly with "easy" components for the design variables
CFumeroTV	Definition of the class FumeroTV
▼CGraph	The class Graph is a service class for solvers of (generalized) Multicommodity Min-Cost Flow problems, i.e., problems of the form
CInf	Very small class to simplify extracting the "+ infinity" value for a basic type (FNumber, CNumber, Index); just use Inf<type>()
CMMCFGException	Small class for exceptions
CKnpsFiOrcl	Instantiation of FiOracle for Knapsack Lagrangian relaxation of FC-MMFC
▼CMCFClass	This abstract base class defines a standard interface for (linear or convex quadartic separable) Min Cost Flow (MCF) problem solvers
CMCFException	Very small class to simplify extracting the "+ infinity" value for a basic type (FNumber, CNumber, Index); just use Inf<type>()
CMCFState	Base class for representing the internal state of the MCF algorithm
CMCFCplex	Derives from the abstract base class MCFClass, thus sharing its (standard) interface, and solves (Linear) Min Cost Flow problems via calls to Cplex Callable Library functions
CMCFSimplex	Derives from the abstract base class MCFClass, thus sharing its (standard) interface, and implements both the Primal and Dual network simplex algorithms for solving (Linear and Quadratic) Min Cost Flow problems
▼CMMCFClass	This class defines a standard abstract interface for solvers of (generalized) Multicommodity Min-Cost Flow problems, i.e., problems of the form
CMMCFException	Very small class to simplify extracting the "+ infinity" value for a basic type (FNumber, CNumber, Index); just use Inf<type>()
CMMCFCplex	The class MMCFCplex implements the generic interface for Multicommodity Min-Cost Flow solvers defined by the class MMCFClass [see MMCFClas.h]
CNDOException	Small class for exceptions
CNDOSolver	The class NDOSolver provides a general interface between convex (NonDifferentiable) optimization solvers and the applications that may need to use them
CPolyak	Definition of the class Polyak
CPrimalDual	Definition of the class PrimalDual
CSPTree	Derives from the abstract base class MCFClass, thus sharing its (standard) interface, and implements Shortest Path Tree algorithms for solving "uncapacitated" (Linear) Min Cost Flow problems with one source node
CStepsize	The class Stepsize provides an interface for the stepsize rule, to be used in the SubGrad solver [see SubGrad.h]
CSubGrad	The `SubGrad` class implements the NDOSolver interface for NonDifferentiable Optimization Solvers [see NDOSlver.h], using a unified subgradient-type algorithm as described in:
CVolume	Definition of the class Volume