A Network Simplex Method for the Budget-Constrained Minimum Cost Flow Problem

30 Sep 2016 Holzhauser Michael Krumke Sven O. Thielen Clemens

We present a specialized network simplex algorithm for the budget-constrained minimum cost flow problem, which is an extension of the traditional minimum cost flow problem by a second kind of costs associated with each edge, whose total value in a feasible flow is constrained by a given budget B. We present a fully combinatorial description of the algorithm that is based on a novel incorporation of two kinds of integral node potentials and three kinds of reduced costs... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS
  • OPTIMIZATION AND CONTROL