Results 111 to 120 of about 15,299 (139)
Some of the next articles are maybe not open access.
A new strongly polynomial dual network simplex algorithm
Mathematical Programming, 1997This paper presents a new dual network simplex algorithm for the minimum cost network flow problem. The algorithm works directly on the original capacitated network and runs in O(mn(m + n log n) log n) time for the network with n nodes and m arcs. This complexity is better than the complexity of Orlin, Plotkin and Tardos' (1993) dual network simplex ...
Armstrong, Ronald D., Jin, Zhiying
openaire +2 more sources
Strongly Polynomial Algorithms for Transient and Average-Cost MDPs
ACM SIGMETRICS Performance Evaluation Review, 2017This paper considers transient total-cost MDPs with transition rates whose values may be greater than one, and average-cost MDPs satisfying the condition that the expected time to hit a certain state from any initial state and under any stationary policy is bounded above by a constant. Linear programming formulations for such MDPs are provided that are
Eugene A. Feinberg, Jefferson Huang
openaire +1 more source
An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems
Optimization Methods and Software, 2002Let E = { e 1 , e 2 , , e n } be a finite set and $\cal F $ be a family of subsets of E . For each element e i in E , c i is a given capacity and w i is the cost of increasing capacity c i by one unit. The problem is how to expand the capacities of elements in E so that the capacity of $\cal F $ is as large as possible, subject to a given budget ...
Jianzhong Zhang 0001, Zhenhong Liu
openaire +1 more source
A strongly polynomial algorithm for the minimum maximum flow degree problem
Operations Research Letters, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Manoel B. Campêlo, Jhonata A. S. Matias
openaire +2 more sources
A strongly polynomial algorithm for bimodular integer linear programming
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017We present a strongly polynomial algorithm to solve integer programs of the form max{cT x: Ax≤ b, xeℤn }, for AeℤmXn with rank(A)=n, be≤m, ce≤n, and where all determinants of (nXn)-sub-matrices of A are bounded by 2 in absolute value. In particular, this implies that integer programs max{cT x : Q x≤ b, xeℤ≥0n}, where Qe ℤmXn has the property that all ...
Artmann, Stephan +2 more
openaire +3 more sources
Balanced network flows. III. Strongly polynomial augmentation algorithms
Networks, 1999For Parts I and II, see ibid. 33, 1-28, 29-41 (1999; Zbl 0999.90005 and Zbl 0999.90006). In this paper strongly polynomial augmentation algorithms for the maximum balanced flow problem are discussed. These algorithms use a double depth first search procedure.
Fremuth-Paeger, Christian +1 more
openaire +3 more sources
A strongly polynomial Contraction-Expansion algorithm for network flow problems
Computers & Operations Research, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jean Bertrand Gauthier +2 more
openaire +1 more source
Some LCPs solvable in strongly polynomial time with Lemke’s algorithm
Mathematical Programming, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ilan Adler +2 more
openaire +1 more source
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nathan Linial +2 more
openaire +2 more sources
A faster strongly polynomial time algorithm for submodular function minimization
Mathematical Programming, 2007For 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