A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables

Hoang Tuy; Saied Ghannadan; Athanasios Migdalas; Peter Värbrand

doi:10.1007/bf02592091

A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables

Mathematical Programming ◽

10.1007/bf02592091 ◽

1996 ◽

Vol 72 (3) ◽

pp. 229-258 ◽

Cited By ~ 20

Author(s):

Hoang Tuy ◽

Saied Ghannadan ◽

Athanasios Migdalas ◽

Peter Värbrand

Keyword(s):

Transportation Problem ◽

Polynomial Algorithm ◽

Fixed Number ◽

Strongly Polynomial Algorithm ◽

Strongly Polynomial

Download Full-text

Strongly polynomial algorithm for a production-transportation problem with concave production cost

Optimization ◽

10.1080/02331939308843882 ◽

1993 ◽

Vol 27 (3) ◽

pp. 205-227 ◽

Cited By ~ 11

Author(s):

H. Tuy ◽

S. Ghannadan ◽

A. Migdalas ◽

P.V. VÄarbrand

Keyword(s):

Transportation Problem ◽

Production Cost ◽

Polynomial Algorithm ◽

Strongly Polynomial Algorithm ◽

Strongly Polynomial

Download Full-text

A strongly polynomial algorithm for the transportation problem

Mathematical Programming ◽

10.1007/bf01585755 ◽

1995 ◽

Vol 68 (1-3) ◽

pp. 1-13 ◽

Cited By ~ 28

Author(s):

P. Kleinschmidt ◽

H. Schannath

Keyword(s):

Transportation Problem ◽

Polynomial Algorithm ◽

Strongly Polynomial Algorithm ◽

Strongly Polynomial

Download Full-text

Strongly polynomial algorithm for solving the general problem of least modules

Numerical Analysis and Applications ◽

10.1134/s1995423910020035 ◽

2010 ◽

Vol 3 (2) ◽

pp. 133-150

Author(s):

V. V. Mironov

Keyword(s):

General Problem ◽

Polynomial Algorithm ◽

Strongly Polynomial Algorithm ◽

Strongly Polynomial

Download Full-text

A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series—parallel networks

Mathematical Programming ◽

10.1007/bf01581240 ◽

1993 ◽

Vol 59 (1-3) ◽

pp. 117-132 ◽

Cited By ~ 24

Author(s):

Arie Tamir

Keyword(s):

Polynomial Algorithm ◽

Strongly Polynomial Algorithm ◽

Flow Problems ◽

Quadratic Cost ◽

Parallel Networks ◽

Cost Flow ◽

Strongly Polynomial

Download Full-text

Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid

Research Trends in Combinatorial Optimization ◽

10.1007/978-3-540-76796-1_5 ◽

2008 ◽

pp. 69-85 ◽

Cited By ~ 5

Author(s):

Jean Fonlupt ◽

Alexandre Skoda

Keyword(s):

Polynomial Algorithm ◽

Strongly Polynomial Algorithm ◽

Strongly Polynomial

Download Full-text

A strongly polynomial algorithm for a new class of linear inequalities1

Optimization ◽

10.1080/02331939508844062 ◽

1995 ◽

Vol 33 (1) ◽

pp. 43-55 ◽

Cited By ~ 2

Author(s):

O. V. Gorokh ◽

F. Werner

Keyword(s):

Polynomial Algorithm ◽

Strongly Polynomial Algorithm ◽

New Class ◽

Strongly Polynomial

Download Full-text

A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives

SIAM Journal on Computing ◽

10.1137/140978296 ◽

2016 ◽

Vol 45 (5) ◽

pp. 1729-1761 ◽

Cited By ~ 11

Author(s):

László A. Végh

Keyword(s):

Polynomial Algorithm ◽

Minimum Cost ◽

Minimum Cost Flow ◽

Strongly Polynomial Algorithm ◽

Flow Problems ◽

Cost Flow ◽

Minimum Cost Flow Problems ◽

Strongly Polynomial

Download Full-text

A strongly polynomial algorithm for the minimum cost tension problem

Discrete Mathematics ◽

10.1016/s0012-365x(96)00185-9 ◽

1997 ◽

Vol 165-166 ◽

pp. 377-394 ◽

Cited By ~ 5

Author(s):

Malika Hadjiat ◽

Jean François Maurras

Keyword(s):

Polynomial Algorithm ◽

Minimum Cost ◽

Strongly Polynomial Algorithm ◽

Strongly Polynomial

Download Full-text

A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.118 ◽

2020 ◽

pp. 1923-1932

Author(s):

Yutaro Yamaguchi

Keyword(s):

Polynomial Algorithm ◽

Strongly Polynomial Algorithm ◽

Labeled Graphs ◽

Strongly Polynomial

Download Full-text

An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems

Optimization Methods and Software ◽

10.1080/10556780290027819 ◽

2002 ◽

Vol 17 (1) ◽

pp. 61-75 ◽

Cited By ~ 4

Author(s):

Jianzhong Zhang ◽

Zhenhong Liu

Keyword(s):

Polynomial Algorithm ◽

Strongly Polynomial Algorithm ◽

Strongly Polynomial

Download Full-text