Results 121 to 130 of about 15,299 (139)

A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling

Operations Research Letters, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vladimir Kats, Eugene Levner
openaire   +2 more sources

Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization

Mathematical Programming, 2008
The authors study the problem of minimizing bisubmodular functions. They begin by presenting a history of bisubmodularity, its importance and an overview of the algorithms for solving this class of problems. In the second section, the preliminary definitions necessary for this problem are presented, followed by a series of theorems describing the ...
S. Thomas McCormick, Satoru Fujishige
openaire   +3 more sources

On strongly polynomial dual simplex algorithms for the maximum flow problem

Mathematical Programming, 1997
Several pivot rules for the dual network simplex algorithm that enable it to solve a maximum flow problem on an n-node, m-arc network in at most 2nm pivots and O(n^2m) time are presented. These rules are based on the concept of a preflow and depend upon the use of node labels which are either the lengths of a shortest pseudoaugmenting path from those ...
Goldfarb, Donald, Wei, Chen
openaire   +2 more sources

A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem

1999
This paper presents a new strongly polynomial cut canceling algorithm for minimum cost submodular flow. The algorithm is a generalization of our similar cut canceling algorithm for ordinary mincost flow. The advantage of cut canceling over cycle canceling is that cut canceling seems to generalize to other problems more readily than cycle canceling. The
Satoru Iwata 0001, S. Thomas McCormick, Maiko Shigeno   +2 more
openaire   +1 more source

Strongly polynomial-time algorithm

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

A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization

Journal of the ACM, 2020
Neil Olver, László A Vegh
exaly  

A Faster Strongly Polynomial Minimum Cost Flow Algorithm

Operations Research, 1993
James B Orlin
exaly  

Strongly Polynomial-time Algorithm

2013
openaire   +1 more source

Strongly polynomial-time algorithm

2011
openaire   +1 more source

A strongly polynomial algorithm for solving two-sided linear systems in max-algebra

Discrete Applied Mathematics, 2006
Peter Butkovic, Karel Zimmermann
exaly