Results 271 to 280 of about 87,677 (298)

A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems

Mathematics of Operations Research, 1989
The only known strongly polynomial algorithm for solving minimum cost submodular flow problems is due to Frank and Tardos (Frank, A., É. Tardos. 1985. An application of the simultaneous approximation in combinatorial optimization. Report No. 85375, Institut für Ökonometrie und Operations Research, Bonn, May.) and is based on the simultaneous ...
Satoru Fujishige, Hans Röck, Uwe Zimmermann   +2 more
openaire   +1 more source

Calibrated Recommendations as a Minimum-Cost Flow Problem

Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, 2023
Himan Abdollahpouri, Zahra Nazari, Alex Gain, Clay Gibson, Maria Dimakopoulou, Jesse Anderton, Benjamin A. Carterette, Mounia Lalmas, Tony Jebara   +8 more
openaire   +1 more source

Parallel Algorithms for Solving the Convex Minimum Cost Flow Problem

Computational Optimization and Applications, 2001
The separable convex cost network flow problem is considered. A parallel asynchronous version of the \(\varepsilon\)-relaxation method is proposed and its correctness is proved. Two implementations of the parallel method are presented and their numerical performance on several standard test problems is empirically analyzed.
BERALDI, Patrizia, GUERRIERO, Francesca, MUSMANNO, Roberto   +2 more
openaire   +2 more sources

A Flow Augmentation Approach to the Network with Gains Minimum Cost Flow Problem

Management Science, 1977
A network with gains has branches in which the ratio between the flow leaving a branch and the flow entering a branch is a positive constant called the gain. Branch gains may be greater or less than one. Such networks arise in water resources and electrical power planning problems, among others. This paper presents a dual method of finding the minimum
P. A. Jensen, Gora Bhaumik
openaire   +2 more sources

Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory

Computers and Operations Research, 2023
Somayeh Khezri
exaly  

Minimum Cost Flow Problem

2001
Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin   +2 more
openaire   +1 more source

The biobjective undirected two-commodity minimum cost flow problem

European Journal of Operational Research, 2005
Antonio Sedeño-Noda
exaly  

A two-phase algorithm for the biobjective integer minimum cost flow problem

Computers and Operations Research, 2009
Andrea Raith, Matthias Ehrgott
exaly  

MINIMUM-COST Network-flow problem

2001
Saul I. Gass, Carl M. Harris
openaire   +1 more source

The budgeted minimum cost flow problem with unit upgrading cost

Networks, 2017
Christina Busing, Arie M C A Koster
exaly