CNDSM  1.00
MMCFFlwB.h File Reference

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...

#include "MMCFClas.h"
#include "Graph.h"
#include "MCFClass.h"

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...
 

Detailed Description

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.

Version
3.01
Date
11 - 05 - 2012
Author
Antonio Frangioni
Operations Research Group
Dipartimento di Informatica
Universita' di Pisa
Copyright(C) 1992 - 2012 Antonio Frangioni

Macro Definition Documentation

#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.