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 条
  • [1] A POLYNOMIAL-TIME SIMPLEX-METHOD FOR THE MAXIMUM K-FLOW PROBLEM
    WAGNER, DK
    WAN, H
    MATHEMATICAL PROGRAMMING, 1993, 60 (01) : 115 - 123
  • [2] A POLYNOMIAL-TIME DUAL SIMPLEX ALGORITHM FOR THE MINIMUM COST FLOW PROBLEM
    NAKAYAMA, A
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1987, 30 (03) : 265 - 290
  • [3] Polynomial-time algorithms for special cases of the maximum confluent flow problem
    Dressler, Daniel
    Strehler, Martin
    DISCRETE APPLIED MATHEMATICS, 2014, 163 : 142 - 154
  • [4] A Polynomial-Time Algorithm for the Maximum Clique Problem
    Akbari, Zohreh O.
    2013 IEEE/ACIS 12TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE (ICIS), 2013, : 503 - 507
  • [5] A Polynomial-time Solution for the Maximum Subsets Problem
    Challita, Khalil
    Abdo, Jacques Bou
    Farhat, Hikmat
    Makary, Mireille
    IAENG International Journal of Computer Science, 2022, 49 (04)
  • [6] Polynomial-Time Solvability of the Maximum Clique Problem
    Tomita, Etsuji
    Nakanishi, Hiroaki
    COMPUTING AND COMPUTATIONAL INTELLIGENCE, PROCEEDINGS, 2009, : 203 - +
  • [7] Polynomial-time primal simplex algorithms for the minimum cost network flow problem
    Goldfarb, Donald
    Hao, Jianxiu
    Algorithmica (New York), 1992, 8 (02): : 145 - 160
  • [8] POLYNOMIAL-TIME PRIMAL SIMPLEX ALGORITHMS FOR THE MINIMUM COST NETWORK FLOW PROBLEM
    GOLDFARB, D
    HAO, JX
    ALGORITHMICA, 1992, 8 (02) : 145 - 160
  • [9] Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem
    Anders Dessmark
    Jesper Jansson
    Andrzej Lingas
    Eva-Marta Lundell
    Algorithmica, 2007, 48 : 233 - 248
  • [10] Polynomial-time algorithms for the ordered maximum agreement subtree problem
    Dessmark, A
    Jansson, J
    Lingas, A
    Lundell, EM
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2004, 3109 : 220 - 229
12345