A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
We present a new algorithm for bi-objective multi-commodity min cost flow problems. This is the first application of DantzigWolfe decomposition to biobjective problems. Numerical results demonstrate the effectiveness of the algorithm.
column generation dantzigwolfe decomposition network flows bi-objective multi-commodity minimum cost flow problem bi-objective simplex method