Minimum Cost Noncrossing Flow Problem on a Layered Network.
Yavuz Bogaç TürkogullariI. Kuban AltinelZ. Caner TaskinZeynep SuvakNecati ArasPublished in: CTW (2015)
Keyphrases
- minimum cost
- network flow problem
- network flow
- np hard
- spanning tree
- approximation algorithms
- network simplex algorithm
- queueing systems
- capacity constraints
- transition probabilities
- minimal cost
- mixed integer
- network design problem
- queueing networks
- communication networks
- minimum cost flow
- network design
- lower bound
- undirected graph
- hidden markov models