Results 161 to 170 of about 10,477 (184)

A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nathan Linial, Alex Samorodnitsky, Avi Wigderson   +2 more
openaire   +2 more sources

Strongly polynomial algorithm for a class of combinatorial LCPs

Operations Research Letters, 1987
We show that an LCP with positive definite coefficient matrix can be solved in time polynomially bounded by the size of the numbers in the coefficient matrix. As a special case, we have a strongly polynomial algorithm for the problem of fitting the best convex curve to a given set of points in \(R^ 2\).
Chandrasekaran, R., Kabadi, S. N.
openaire   +1 more source

A faster strongly polynomial time algorithm for submodular function minimization

Mathematical Programming, 2007
For the problem of minimizing a submodular function \(f(x)\) on a finite set \(V\) a strongly polynomial oracle algorithm is suggested. The algorithm uses distance functions and exploits optimality conditions.
openaire   +1 more source

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 Time Algorithm for Multicriteria Global Minimum Cuts

2014
We investigate the bicriteria global minimum cut problem where each edge is evaluated by two nonnegative cost functions. The parametric complexity of such a problem is the number of linear segments in the parametric curve when we take all convex combinations of the criteria. We prove that the parametric complexity of the global minimum cut problem is O(
Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne   +3 more
openaire   +1 more source

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

Strongly Polynomial FPTASes for Monotone Dynamic Programs

Algorithmica, 2022
Nir Halman
exaly