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

Algorithm 21.2: circulation decomposition. More...

Go to the source code of this file.

Functions

function circulationDecomposition (in adj, in circ)
 Decompose a circulation into simple cycle flows. More...
 

Detailed Description

Algorithm 21.2: circulation decomposition.

Implementation of algorithm 21.2 of [1]

Note
Tested with runCirculationDecomposition.m
Calls simpleCycle
Called by flowDecomposition
Author
Michel Bierlaire
Date
Sun Mar 29 17:16:14 2015

Definition in file circulationDecomposition.m.

Function Documentation

function circulationDecomposition ( in  adj,
in  circ 
)

Decompose a circulation into simple cycle flows.

Parameters
adjthe adjacency matrix of the network. It is a $m \times m$ 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.
circthe circulation flow
Returns
simpleCycleFlows a matrix with as many columns as arcs, and as many rows as simple cycles in the decomposition
Copyright 2015-2016 Michel Bierlaire