Polynomial-time simplex method for the maximum k-flow problem

被引:0
|
作者
机构
[1] Wagner, Donald K.
[2] Wan, Hong
来源
Wagner, Donald K. | 1600年 / 60期
关键词
Mathematical programming;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [31] FINDING THE WEIGHTED MINIMAX FLOW IN A POLYNOMIAL-TIME
    ICHIMORI, T
    ISHII, H
    NISHIDA, T
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1980, 23 (03) : 268 - 272
  • [32] A polynomial-time exact algorithm for the connected k-facility location problem on trees
    Ding, Wei
    Chen, Guangting
    Zhou, Yu
    Qiu, Ke
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024,
  • [33] Two cases of polynomial-time solvability for the coloring problem
    D. S. Malyshev
    Journal of Combinatorial Optimization, 2016, 31 : 833 - 845
  • [34] A polynomial-time approximation scheme for the airplane refueling problem
    Gamzu, Iftah
    Segev, Danny
    JOURNAL OF SCHEDULING, 2019, 22 (01) : 119 - 135
  • [35] POLYNOMIAL-TIME ALGORITHM FOR KNAPSACK PROBLEM WITH 2 VARIABLES
    HIRSCHBERG, DS
    WONG, CK
    JOURNAL OF THE ACM, 1976, 23 (01) : 147 - 154
  • [36] A polynomial-time algorithm for the change-making problem
    Pearson, D
    OPERATIONS RESEARCH LETTERS, 2005, 33 (03) : 231 - 234
  • [37] A POLYNOMIAL-TIME METHOD FOR OPTIMAL SOFTWARE PIPELINING
    VANDONGEN, VH
    GAO, GR
    NING, Q
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 634 : 613 - 624
  • [38] POLYNOMIAL-TIME INSTANCES OF THE MINIMUM WEIGHT TRIANGULATION PROBLEM
    ANAGNOSTOU, E
    CORNEIL, D
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1993, 3 (05): : 247 - 259
  • [39] Polynomial-Time Approximation Algorithms for Weighted LCS Problem
    Cygan, Marek
    Kubica, Marcin
    Radoszewski, Jakub
    Rytter, Wojciech
    Walen, Tomasz
    COMBINATORIAL PATTERN MATCHING, 22ND ANNUAL SYMPOSIUM, CPM 2011, 2011, 6661 : 455 - 466
  • [40] A polynomial-time approximation scheme for the airplane refueling problem
    Iftah Gamzu
    Danny Segev
    Journal of Scheduling, 2019, 22 : 119 - 135