CNDSM
1.00
|
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. More...
Macros | |
#define | FlowBase_HAVE_SPT 1 |
FlowBase_HAVE_SPT > 0 means that a Shortest Path Tree (SPT) solver is available; this allows "super-disaggregate" solutions whereby a subproblem is a specific O-D pair within a single (SPT) (possibly with multiple destinations for that single origin). More... | |
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.
This is done by using an array of k appropriate single-commodity Min Cost Flow (MCF) solvers derived from the base class MCFClass [see MCFClass.h]. "extra" variables or constraints are not supported. The class implements the MMCFClass interface, see MMCFClas.h.
#define FlowBase_HAVE_SPT 1 |
FlowBase_HAVE_SPT > 0 means that a Shortest Path Tree (SPT) solver is available; this allows "super-disaggregate" solutions whereby a subproblem is a specific O-D pair within a single (SPT) (possibly with multiple destinations for that single origin).
FlowBase_HAVE_SPT == 1 means that the (SPT) solver is the SPTree class.