Finding all minimum cost flows and a faster algorithm for the K best flow problem

05/21/2021
by   David Könen, et al.
0

This paper addresses the problem of determining all optimal integer solutions of a linear integer network flow problem, which we call the all optimal integer flow (AOF) problem. We derive an O(F (m + n) + mn + M ) time algorithm to determine all F many optimal integer flows in a directed network with n nodes and m arcs, where M is the best time needed to find one minimum cost flow. We remark that stopping Hamacher's well-known method for the determination of the K best integer flows at the first sub-optimal flow results in an algorithm with a running time of O(F m(n log n + m) + M ) for solving the AOF problem. Our improvement is essentially made possible by replacing the shortest path sub-problem with a more efficient way to determine a so called proper zero cost cycle using a modified depth-first search technique. As a byproduct, our analysis yields an enhanced algorithm to determine the K best integer flows that runs in O(Kn3 + M ). Besides, we give lower and upper bounds for the number of all optimal integer and feasible integer solutions. Our bounds are based on the fact that any optimal solution can be obtained by an initial optimal tree solution plus a conical combination of incidence vectors of all induced cycles with bounded coefficients.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/01/2022

Minimum-Cost Flows Over Time

In this paper we show that every maximum minimum-cost flow over time pro...
research
03/01/2022

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time

We give an algorithm that computes exact maximum flows and minimum-cost ...
research
03/10/2020

Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs

We present an m^11/8+o(1)log W-time algorithm for solving the minimum co...
research
12/09/2019

Novel approach for solving a variant of equal flow problem

In this article we consider a certain sub class of Integer Equal Flow pr...
research
02/10/2021

A linear input dependence model for interdependent networks

We consider a linear relaxation of a generalized minimum-cost network fl...
research
07/21/2019

Heuristic solutions to robust variants of the minimum-cost integer flow problem

This paper deals with robust optimization applied to network flows. Two ...
research
03/27/2013

The Optimality of Satisficing Solutions

This paper addresses a prevailing assumption in single-agent heuristic s...

Please sign up or login with your details

Forgot password? Click here to reset