A Faster Strongly Polynomial Minimum Cost Flow Algorithm [PDF]
Operations Research, 1988 In this paper, we present a new strongly polynomial time algorithm for the minimum cost flow problem, based on a refinement of the Edmonds-Karp scaling technique. Our algorithm solves the uncapacitated minimum cost flow problem as a sequence of O(n log n) shortest path problems on networks with n nodes and m arcs and runs in O(n log n(m + n log n ...
James B. Orlin, James Orlin
openaire +6 more sources
A strongly polynomial algorithm for the minimum cost tension problem [PDF]
Discrete Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Malika Hadjiat, Jean François Maurras
openaire +2 more sources
A strongly polynomial algorithm for line search in submodular polyhedra [PDF]
Discrete Optimization, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nagano, Kiyohito
openaire +2 more sources
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs [PDF]
CoRR, 2018 The theory of $n$-fold integer programming has been recently emerging as an important tool in parameterized complexity. The input to an $n$-fold integer program (IP) consists of parameter $A$, dimension $n$, and numerical data of binary encoding length $L$.
Martin Koutecký, Asaf Levin, Shmuel Onn
openaire +6 more sources
A strongly polynomial time algorithm for a constrained submodular optimization problem [PDF]
Discrete Applied Mathematics, 2001 The author [Math. Oper. Res. 23, No. 3, 661--679 (1998; Zbl 0977.90073)] presented a weakly polynomial time algorithm for the problem of optimizing over the intersection of a submodular base polyhedron and an affine space (when the number of constraints describing the affine space is bounded).
Hartvigsen, David, David Hartvigsen
openaire +3 more sources
A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees [PDF]
, 2023 General factors are a generalization of matchings. Given a graph G with a set π(v) of feasible degrees, called a degree constraint, for each vertex v of G, the general factor problem is to find a (spanning) subgraph F of G such that deg_F(v) ∈ π(v) for ...
Shao, Shuai, Živný, Stanislav
core +1 more source
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions [PDF]
Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000 17 ...
Satoru Iwata 0001 +2 more
openaire +2 more sources
A strongly polynomial-time algorithm for minimizing submodular functions [PDF]
, 1999 This paper presents a combinatorial polynomial-time algorithm for minimizing submolular set functions. The algorithm employs a scaling scheme that uses a flow in the complete directed graph on the underlying set with each arc capacity equal to the scaled
Fleischer, Lisa +2 more
core
A strongly polynomial algorithm for the inverse shortest arborescence problem
Discrete Applied Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhiquan Hu, Zhenhong Liu
openaire +1 more source
A Combinatorial, Strongly Polynomial-Time Algorithm for Minimizing Submodular Functions [PDF]
, 2001 This paper presents the first combinatorial polynomial-time algorithm for minimizing submodular functions, answering an open question posed in 1981 by Grötschel, Lovász, and Schrijver. The algorithm employs a scaling scheme that uses a ow in the complete
Satoru Fujishige +2 more
core