Optimization: principles and algorithms, by Michel Bierlaire
flowDecomposition.m File Reference

Algorithm 21.3: flow decomposition. More...

Go to the source code of this file.

## Functions

function flowDecomposition (in adj, in flow)
Decompose a flow vector into simple path flows. More...

## Detailed Description

Algorithm 21.3: flow decomposition.

Implementation of algorithm 21.3 of [1]

Note
Tested with runFlowDecomposition.m
Calls nodeDivergence
Calls circulationDecomposition
Date
Sun Mar 29 17:26:50 2015

Definition in file flowDecomposition.m.

## Function Documentation

 function flowDecomposition ( in adj, in flow )

Decompose a flow vector into simple path flows.

Parameters
 adj the adjacency matrix of the network. It is a matrix, such that the element at row i and column j corresponds to the id of the arc (i,j). The numbering should be from 1 to n. flow the flow vector
Returns
simplePathFlows a matrix with as many columns as arcs, and as many rows as simple paths in the decomposition