Results 1  10
of
2,598,380
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 565 (0 self)
 Add to MetaCart
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps
Network Flow Problems in Constraint Programming
"... We introduce a new global constraint for modeling and solving network flow problems in constraint programming. We describe the declarative and operational semantics of the flow constraint and illustrate its use through a number of applications. ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We introduce a new global constraint for modeling and solving network flow problems in constraint programming. We describe the declarative and operational semantics of the flow constraint and illustrate its use through a number of applications.
The Complexity Of The Maximum Network Flow Problem
, 1980
"... This thesis deals with the computational complexity of the maximum network flow problem. We first introduce the basic concepts and fundamental theorems upon which the study of "maxflow" has been built. We then trace the development of maxflow algorithms from the original "labeling a ..."
Abstract
 Add to MetaCart
This thesis deals with the computational complexity of the maximum network flow problem. We first introduce the basic concepts and fundamental theorems upon which the study of "maxflow" has been built. We then trace the development of maxflow algorithms from the original "
ON NETWORK FLOW PROBLEMS WITH CONVEX COST
"... Minimum cost flow (MCF) problem is a typical example of network flow problems, for which an additional constraint of cost is added to each flow. Conventional MCF problems consider the cost constraints as linear functions of flow. In this paper, we extend the MCF problem to cover cost functions as st ..."
Abstract
 Add to MetaCart
Minimum cost flow (MCF) problem is a typical example of network flow problems, for which an additional constraint of cost is added to each flow. Conventional MCF problems consider the cost constraints as linear functions of flow. In this paper, we extend the MCF problem to cover cost functions
Bayesian Analysis Of Network Flow Problems
, 1997
"... (Statistics) BAYESIAN ANALYSIS OF NETWORK FLOW PROBLEMS by Claudia Tebaldi Department of Institute of Statistics and Decision Sciences Duke University Date: Approved: Mike West, Supervisor Valen Johnson Dalene Stangl Alan Karr An abstract of a dissertation submitted in partial fulfillment of the req ..."
Abstract
 Add to MetaCart
(Statistics) BAYESIAN ANALYSIS OF NETWORK FLOW PROBLEMS by Claudia Tebaldi Department of Institute of Statistics and Decision Sciences Duke University Date: Approved: Mike West, Supervisor Valen Johnson Dalene Stangl Alan Karr An abstract of a dissertation submitted in partial fulfillment
Diagnosing Infeasibilities in Network Flow Problems
 MATH. PROGRAMMING
, 1998
"... We consider the problem of finding a feasible flow in a directed G = (N, A) in which each node i N has a supply b(i), and each arc (i, j) A has a zero lower bound on flow and an upper bound u ij . It is well known that this feasibility problem can be transformed into a maximum flow problem. It i ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
) of the network flow problem. In the case that there are many different witnesses for an infeasible problem, a small cardinality witness may be preferable in practice because it is generally easier for the user to assimilate, and may provide more guidance to the user on how to identify the cause
Improved Edmond Karps Algorithm for Network Flow Problem
"... Network Flow Problems have always been among the best studied combinatorial optimization problems. Flow networks are very useful to model real world problems like, current flowing through electrical networks, commodity flowing through pipes and so on. Maximum flow problem is the classical network fl ..."
Abstract
 Add to MetaCart
Network Flow Problems have always been among the best studied combinatorial optimization problems. Flow networks are very useful to model real world problems like, current flowing through electrical networks, commodity flowing through pipes and so on. Maximum flow problem is the classical network
Development of An Algorithm for All Type of Network Flow Problems
"... We develop an algorithm which reduces the arbitrary instance of the network flow problem to a simple path disjoint network in polynomial time. Then the flow in each path is taken as the minimum of the arc capacities of that path from where the flow in each arc can be easily determined. The polynomia ..."
Abstract
 Add to MetaCart
We develop an algorithm which reduces the arbitrary instance of the network flow problem to a simple path disjoint network in polynomial time. Then the flow in each path is taken as the minimum of the arc capacities of that path from where the flow in each arc can be easily determined
Interior Point Algorithms For Network Flow Problems
 in Advances in linear and integer programming
, 1996
"... . Computational algorithms for the solution of network flow problems are of great practical significance. In the last decade, a new class of computationally efficient algorithms, based on the interior point method, has been proposed and applied to solve large scale network flow problems. In this cha ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
. Computational algorithms for the solution of network flow problems are of great practical significance. In the last decade, a new class of computationally efficient algorithms, based on the interior point method, has been proposed and applied to solve large scale network flow problems
Incremental Algorithms for Some Network Flow Problems
, 2001
"... In many network flow problems an incremental algorithm yields an enormous saving in computation time. The goal of such an algorithm is to update the solution to an instance of a problem after a unit change is made in the input. In this thesis the maxflow problem and shortest path problem are consid ..."
Abstract
 Add to MetaCart
In many network flow problems an incremental algorithm yields an enormous saving in computation time. The goal of such an algorithm is to update the solution to an instance of a problem after a unit change is made in the input. In this thesis the maxflow problem and shortest path problem
Results 1  10
of
2,598,380