Výsledky vyhľadávania - "Strongly polynomial time algorithm"

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

“…In this work, we advance the understanding of the fundamental limits of computation for binary polynomial optimization (BPO), which is the problem of…”
Získať plný text

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

“…The max+sum spanning tree ( MSST ) problem is to determine a spanning tree T whose combined weight max e ∈ T w ( e ) + ∑ e ∈ T c ( e ) is minimum for a given…”
Získať plný text

Vertex quickest 1-center location problem on trees and its inverse problem under weighted l∞ norm Autor 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…”
Získať plný text

Partial inverse min–max spanning tree problem under the weighted bottleneck hamming distance Autor 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…”
Získať plný text

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

“…We consider the lower bounded inverse optimal value problem on minimum spanning tree under unit l ∞ norm. Given an edge weighted connected undirected network G…”
Získať plný text

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

“…We consider the inverse optimal value problem on minimum spanning tree under unit l ∞ norm. Given an edge weighted connected undirected network G = ( V , E , w…”
Získať plný text

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

“…Given a directed graph with a capacity and a transit time for each arc and with single source and single sink nodes, the quickest flow problem is to find the…”
Získať plný text

A faster capacity scaling algorithm for minimum cost submodular flow Autor Fleischer, Lisa, Iwata, Satoru, McCormick, S. Thomas

“…We describe an O(n4hmin{logU,n2logn}) capacity scaling algorithm for the minimum cost submodular flow problem. Our algorithm modifies and extends the…”
Získať plný text

The subdivision-constrained minimum spanning tree problem Autor Li, Jianping, Li, Weidong, Zhang, Tongquan, Zhang, Zhongxu

“…Motivated by the constrained minimum spanning tree (CST) problem in Hassin and Levin [R. Hassin, A. Levin, An efficient polynomial time approximation scheme…”
Získať plný text

Single-machine scheduling with trade-off between number of tardy jobs and compression cost Autor He, Yong, Wei, Qi, Cheng, T. C. E.

“…We consider a single-machine scheduling problem, in which the job processing times are controllable or compressible. The performance criteria are the…”
Získať plný text

A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow Autor Iwata, Satoru, McCormick, S. Thomas, Shigeno, Maiko

“…This paper presents a new strongly polynomial cut canceling algorithm for minimum cost submodular flow. The algorithm is a generalization of our similar cut…”
Získať plný text

Network Expansion Problem on the Spanning Tree in Graphs Autor Jianping Li, Juanping Zhu

“…Motivated by various network improvement models, we study the problem to add some new edges to satisfy the increasing information demand and keep the…”
Získať plný text

The subdivision-constrained routing requests problem Autor 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…”
Získať plný text

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

“…We consider two special cases of the Minimum Concave Cost Network Flow Problem (MCCNFP);the single source uncapacitated MCCNFP where all arc costs, except two,…”
Získať plný text