Suchergebnisse - "Strongly polynomial-time algorithms"

The subdivision-constrained routing requests problem von Li, Jianping, Li, Weidong, Lichen, Junran

“… We are given a digraph D =( V , A ; w ), a length (delay) function w : A → R + , a positive integer d and a set of k requests, where s i ∈ V is called as the i …”
Volltext

A faster strongly polynomial time algorithm for submodular function minimization von Orlin, James B.

“… We consider the problem of minimizing a submodular function f defined on a set V with n elements. We give a combinatorial algorithm that runs in O( n 5 EO  +  …”
Volltext

Strongly polynomial algorithm for two special minimum concave cost network flow problems von Tuy, H., Ghannadan, S., Migdalas, A., VÄrbrand, P.

“… Due to their specific structure these problems can he solved by efficient strongly polynomial time algorithms …”
Volltext

A faster strongly polynomial time algorithm to solve the minimum cost tension problem von 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 …”
Volltext

A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem von Oliveira, Paulo Roberto

“… A strongly polynomial-time algorithm is proposed for the strict homogeneous linear-inequality feasibility problem in the positive orthant, that is, to obtain x …”
Volltext

On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs von Del Pia, Alberto, Di Gregorio, Silvia

“… In fact, we give a strongly polynomial-time algorithm for instances whose corresponding hypergraph is β -acyclic. We note that the β …”
Volltext

Inverse max+sum spanning tree problem under weighted l∞ norm by modifying max-weight vector von Jia, Junhua, Guan, Xiucui, Zhang, Qiao, Qian, Xinqiang, Pardalos, Panos M.

“… ( e ). We first provide some optimality conditions of the problem. Then we propose a strongly polynomial time algorithm in O ( m 2 log n …”
Volltext

Efficient Algorithms for the Dynamic Pricing Problem with Reference Price Effect von Chen, Xin, Hu, Peng, Hu, Zhenyu

“… optimization methods can be applied. We identify a few key structural properties of the problem, which enable us to develop strongly polynomial-time algorithms to compute the optimal prices for several plausible scenarios …”
Volltext

Vertex quickest 1-center location problem on trees and its inverse problem under weighted l∞ norm von Qian, Xinqiang, Guan, Xiucui, Jia, Junhua, Zhang, Qiao, Pardalos, Panos M.

“… In view of some shortcomings of traditional vertex 1-center (V1C), we introduce a vertex quickest 1-center (VQ1C) problem on a tree, which aims to find a …”
Volltext

The lower bounded inverse optimal value problem on minimum spanning tree under unit l∞ norm von Zhang, Binwu, Guan, Xiucui, Pardalos, Panos M., Wang, Hui, Zhang, Qiao, Liu, Yan, Chen, Shuyi

“… We present a mathematical model of the problem. After analyzing optimality conditions of the problem, we develop a strongly polynomial time algorithm with running time O (| V || E …”
Volltext

Partial inverse min–max spanning tree problem under the weighted bottleneck hamming distance von Dong, Qingzhen, Li, Xianyue, Yang, Yu

“… Min–max spanning tree problem is a classical problem in combinatorial optimization. Its purpose is to find a spanning tree to minimize its maximum edge in a …”
Volltext

Inverse optimal value problem on minimum spanning tree under unit l∞ norm von Zhang, Binwu, Guan, Xiucui, Zhang, Qiao

“… Then we develop a strongly polynomial time algorithm with running time O (| V || E |). Finally, we give an example to demonstrate the algorithm …”
Volltext

A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees von Shao, Shuai, Živný, Stanislav

“… In this paper, we present the first strongly polynomial-time algorithm for a type of weighted general factor problems with real-valued edge weights that is provably not reducible to the weighted …”
Volltext

Cancel‐and‐tighten algorithm for quickest flow problems von Saho, Masahide, Shigeno, Maiko

“… In this article, we modify their algorithm by adopting a technique to construct a strongly polynomial time algorithm for solving the minimum cost flow problem. The proposed algorithm runs in O ( n m 2 ( log n ) 2 ) time, where n and m are the numbers of nodes and arcs, respectively. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 69(2), 179–188 2017 …”
Volltext

Validation of a strongly polynomial-time algorithm for the general linear programming problem von Awoniyi, Samuel

“… This article presents a validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem …”
Volltext

A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization von Yin Tat Lee, Sidford, Aaron, Sam Chiu-Wai Wong

“… In this paper we improve upon the running time for finding a point in a convex set given a separation oracle. In particular, given a separation oracle for a …”
Volltext

Lipschitz Continuity and Approximate Equilibria von Deligkas, Argyrios, Fearnley, John, Spirakis, Paul

“… In this paper, we study games with continuous action spaces and non-linear payoff functions. Our key insight is that Lipschitz continuity of the payoff …”
Volltext

A numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming problem von Awoniyi, Samuel

“… Utilizing illustrative linear programming (LP) problem instances, this article presents a numerical illustration of a recently proposed strongly polynomial-time algorithm for the general LP problem …”
Volltext

Some robust inverse median problems on trees with interval costs von Dai, Le Xuan, Nguyen, Kien Trung, Thao, Le Phuong, Vui, Pham Thi

“… We address the problem of modifying vertex weights of a tree in such an optimal way that a given facility (vertex) becomes a 1-median in the modified tree …”
Volltext

Minimizing the expense transmission time from the source node to demand nodes von Ghiyasvand, Mehdi, Keshtkar, Iman

“… An undirected graph G = ( V , A ) by a set V of n nodes, a set A of m edges, and two sets S , D ⊆ V consists of source and demand nodes are given. This paper …”
Volltext