File List

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

ColorTV.h	Definition and implementation of the class ColorTV, which is a stepsizes rule (SR) to be used within the subgradient method (SM) [see SubGrad.h]
CQKnPClass.h	Definition of the abstract base class CQKnPClass, which implements a standard interface for Continuous Quadratic Knapsack Problem (CQKnP) solvers to be implemented as derived classes
Deflection.h	Definition of the abstract class Deflection, which defines the interface for computing the delflection coefficient within the SubGrad class [see SubGrad.h]
DualCQKnP.h	Basis Continuous Quadratic Knapsack Problems (CQKnP) solver based on the standard dual-ascent approach
ExDualCQKnP.h	Continuous Quadratic Knapsack Problems (CQKnP) solver based on the standard dual-ascent approach, which extends the DualCQKnP class to non-negative quadratic costs and extended real bounds (and therefore fully conforms to the standard interface for CQKnP solver defined by the abstract base class CQKnpClass)
FiOracle.h	Definition of the abstract base class FiOracle, which sets the interface for the "black boxes" (oracles) computing [approximate] function values and [epsilon-]subgradients for (constrained) NonDifferentiable Optimization algorithms
FlwFiOrcl.h	Definition of the FlwFiOrcl class which implements the FiOracle interface and solves the flow Lagrangian relaxation of the (Fixed-Charge) Multicommodity Min Cost Flow Problem ((FC-)MMCF), possibly with "easy" components for the design variables
FumeroTV.h	Definition and implementation of the class FumeroTV, which is a stepsizes rule (SR) to be used within the subgradient method (SM) [see SubGrad.h]
Graph.h	Header file for the Graph class, which provides an unified mean for reading descriptions of (Linear) Multicommodity Min Cost Flow problems and storing them in memory, along with a simple interface that can be used by any MMCF solver to access and change the data
KnpsFiOrcl.h	Definition of the KnpsFiOrcl class which implements the FiOracle interface and solves the knapsack Lagrangian relaxation of the (Fixed-Charge) Multicommodity Min Cost Flow Problem ((FC-)MMCF)
MainPage.h	Main Page for the Doxygen documentation of the CNDSM Project
MCFClass.h	Header file for the abstract base class MCFClass, which defines a standard interface for (linear or convex quadratic separable) Min Cost Flow Problem solvers, to be implemented as derived classes
MCFCplex.h	Quadratic Min Cost Flow problems solver, based on calls to the Cplex Callable Libraries
MCFSimplex.h	Linear and Quadratic Min Cost Flow problems solver based on the (primal and dual) simplex algorithm
MMCFClas.h	Header file for the abstract (pure virtual) base class MMCFClass, which defines a standard interface for solvers of Multicommodity Min Cost Flow problems, or, more in general, problems with the MMCF structure "plus or minus" some variables and/or constraints
MMCFCple.h	Multicommodity Min Cost Flow (MMCF) Problems solver, based on calls calls to the Cplex Callable Libraries for solution of generic LPs
MMCFFlwB.h	Header file for the class MMCFFlwBase, which solves relaxations of the Multicommodity Min Cost Flow (MMCF) problem where the Mutual Capacity constraints are relaxed, that is, k independent single-commodity Min Cost Flow or Shortest Path subproblems
NDOSlver.h	Definition of the abstract base class NDOSolver, which defines the interface for convex minimization algorithms
Polyak.h	The class Polyak implements the easiest target value stepsize rule, with a constant level and the factor beta
PrimalDual.h	The class PrimalDual implements two variants of the Primal-Dual subgradient method (PDSM): the simple and weighted averages
SPTree.h	Implementation of several "classic" Shortest Path Tree algorithms to solve uncapacitated single-source Min Cost Flow problems
Stepsize/Stepsize.h	Definition of the abstract Stepsize class, which defines the interface for computing the stepsize rule (SR) used by the SubGrad class [see SubGrad.h]
Stepsize.h	Definition of the abstract Stepsize class, which defines the interface for computing the stepsize rule (SR) used by the SubGrad class [see SubGrad.h]
SubGrad.h	Definition of the SubGrad class, which implements the NDOSolver interface for NonDifferentiable Optimization Solvers, as described in NDOSlver.h, using a (deflected, projected, incremental) subgradient-type algorithm
Volume.h	The class Volume implements the deflection rule of the modified Volume algorithm, i.e., that of the "poorman's" Bundle method