Probabilistic tree-based representation for solving minimum cost integer flow problems with nonlinear non-convex cost functions.
Behrooz GhasemishabankarehXiaodong LiMelih OzlenFrank NeumannPublished in: Appl. Soft Comput. (2020)
Keyphrases
- minimum cost
- network flow problem
- minimum cost flow
- linear relaxation
- cost function
- quadratic program
- np hard
- network simplex algorithm
- network flow
- approximation algorithms
- convex optimization problems
- convex programming
- integer variables
- spanning tree
- quadratic optimization problems
- minimal cost
- mixed integer
- convex optimization
- optimization problems
- bayesian networks
- network design problem
- capacity constraints
- quadratic programming
- column generation
- objective function