Multiway cut and integer flow problems in trees

2004 ◽  
Vol 17 ◽  
pp. 105-109 ◽  
Author(s):  
Marie-Christine Costa ◽  
Alain Billionnet
Keyword(s):  
Flow Problems ◽  
Multiway Cut ◽  
Integer Flow

scholarly journals Probabilistic tree-based representation for solving minimum cost integer flow problems with nonlinear non-convex cost functions

2020 ◽  
Vol 86 ◽  
pp. 105951
Author(s):  
Behrooz Ghasemishabankareh ◽  
Xiaodong Li ◽  
Melih Ozlen ◽  
Frank Neumann
Keyword(s):  
Minimum Cost ◽  
Cost Functions ◽  
Flow Problems ◽  
Convex Cost ◽  
Integer Flow

scholarly journals Solving Robust Variants of Integer Flow Problems with Uncertain Arc Capacities

2021 ◽  
Vol 33 (1) ◽  
pp. 77-89
Author(s):  
Marko Špoljarec ◽  
Robert Manger
Keyword(s):  
Flow Problem ◽  
Network Flows ◽  
Minimum Cost ◽  
Maximum Flow ◽  
Approximate Algorithm ◽  
Minimum Cost Flow ◽  
Flow Problems ◽  
Unit Costs ◽  
Minimum Cost Flow Problem ◽  
Integer Flow

This paper deals with robust optimization and network flows. Several robust variants of integer flow problems are considered. They assume uncertainty of network arc capacities as well as of arc unit costs (where applicable). Uncertainty is expressed by discrete scenarios. Since the considered variants of the maximum flow problem are easy to solve, the paper is mostly concerned with NP-hard variants of the minimum-cost flow problem, thus proposing an approximate algorithm for their solution. The accuracy of the proposed algorithm is verified by experiments.

A new approach to flow problems past a screen

1985 ◽  
Author(s):  
O. INOUE ◽  
K. KUWAHARA
Keyword(s):  
New Approach ◽  
Flow Problems
Sign in / Sign up

Export Citation Format

Share Document