Výsledky vyhledávání - combinatorial strongly polynomial algorithm

A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time Autor Schrijver, Alexander

“…We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle…”
Získat plný text

Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization Autor McCormick, S. Thomas, Fujishige, Satoru

“… This new method gives a somewhat simpler strongly polynomial SFM algorithm, as well as the first combinatorial strongly polynomial algorithm for BSFM…”
Získat plný text

Polynomial combinatorial algorithms for skew-bisubmodular function minimization Autor Fujishige, Satoru, Tanigawa, Shin-ichi

“… In the present paper we give first combinatorial (weakly and strongly) polynomial algorithms for skew-bisubmodular function minimization…”
Získat plný text

Eisenberg–Gale markets: Algorithms and game-theoretic properties Autor Jain, Kamal, Vazirani, Vijay V.

“…–37], as well as numerous interesting new markets. We obtain combinatorial, strongly polynomial algorithms for several markets in this class…”
Získat plný text

General restricted inverse assignment problems under l1 and l∞ norms Autor Wang, Qin, Yang, Tianyu, Wu, Longshu

“…In this paper, we study the general restricted inverse assignment problems, in which we can only change the costs of some specific edges of an assignment…”
Získat plný text

Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and ℓ ∞ -norm objectives Autor Bérczi, Kristóf, Mendoza-Cadena, Lydia Mirabel, Varga, Kitti

“…In inverse optimization problems, we are given a feasible solution to an underlying optimization problem, and the goal is to modify the problem parameters so…”
Získat plný text

Efficient algorithms for the maximum concurrent flow problem Autor Bauguion, Pierre-Olivier, Ben-Ameur, Walid, Gourdin, Eric

“… Some other decomposition schemes can lead to even faster resolution times. Finally, an efficient strongly polynomial…”
Získat plný text

A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property Autor Garg, Dinesh, Jain, Kamal, Talwar, Kunal, Vazirani, Vijay V.

“…We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross substitutability property…”
Získat plný text

Combinatorial Simplex Algorithms Can Solve Mean Payoff Games Autor Allamigeon, Xavier, Benchimol, Pascal, Gaubert, Stéphane, Joswig, Michael

“… Moreover, any combinatorial simplex algorithm with a strongly polynomial complexity (the existence of such an algorithm is open…”
Získat plný text

A faster strongly polynomial time algorithm to solve the minimum cost tension problem Autor Ghiyasvand, Mehdi

“…This paper presents a strongly polynomial time algorithm for the minimum cost tension problem, which runs in O ( max { m 3 n , m 2 log n ( m + n log n…”
Získat plný text

A Combinatorial, Strongly Polynomial-Time Algorithm for Minimizing Submodular Functions Autor Iwata, Satoru, Fleischer, Lisa, Fujishige, Satoru

“…This paper presents the first combinatorial polynomial-time algorithm for minimizing submodular set functions, answering an open question posed in 1981 by Grotschel, Lovasz, and Schrijver…”
Získat plný text

Inverse Polymatroidal Flow Problem Autor Cai, Mao-Cheng, Yang, Xiaoguang, Li, Yanjun

Získat plný text

A network flow approach to a common generalization of Clar and Fries numbers Autor Bérczi-Kovács, Erika, Frank, András

“… The construction makes it possible to apply any standard cheapest network flow algorithm…”
Získat plný text

A cost-scaling algorithm for computing the degree of determinants Autor Hirai, Hiroshi, Ikeda, Motoki

“… for t . This problem generalizes noncommutative Edmonds' problem and fundamental combinatorial optimization problems including the weighted linear matroid intersection problem…”
Získat plný text

Determinant Maximization via Matroid Intersection Algorithms Autor Brown, Adam, Laddha, Aditi, Pittu, Madhusudhan, Singh, Mohit, Tetali, Prasad

“…{T}}. Often, the set S of picked vectors must satisfy additional combinatorial constraints such as cardinality constraint (|S|\leq k…”
Získat plný text

Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems Autor Magnanti, Thomas L, Stratila, Dan

“… This technique yields a strongly polynomial primal-dual algorithm for a concave cost problem whenever such an algorithm exists for the fixed-charge counterpart of the problem…”
Získat plný text

ε-Approximation minimization of convex functions in fixed dimension Autor Kabadi, S.N., Aneia, Y.P.

“…: if for any given λ ϵ Λ, and any fixed ε, 0 < ε < 1, v( λ) can be evaluated by an ε-approximation (strongly) polynomial combinatorial algorithm, and if any linear function…”
Získat plný text

Layers and matroids for the traveling salesman’s paths Autor Schalekamp, Frans, Sebő, András, Traub, Vera, van Zuylen, Anke

“… A strongly polynomial, combinatorial algorithm follows for finding this convex combination, which is a new tool offering polyhedral insight, already instrumental…”
Získat plný text

Inverse min–max spanning tree problem under the Weighted sum-type Hamming distance Autor Liu, Longcheng, Yao, Enyu

“…–max spanning tree problem under the weighted sum-type Hamming distance. For the model considered, we present its combinatorial algorithm that runs in strongly…”
Získat plný text

Multi-terminal multipath flows: synthesis Autor Chandrasekaran, R., Nair, K.P.K., Aneja, Y.P., Kabadi, S.N.

“… t. In this paper we provide a strongly polynomial combinatorial algorithm for designing an undirected network with minimum total edge capacity which is capable of meeting, non-simultaneously, a given…”
Získat plný text