Series parallel composition of greedy linear programming problems-Reference-Cited by-同舟云学术

Series parallel composition of greedy linear programming problems

Published:1993-02 Issue:1-3 Volume:62 Page:1-14
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Bein Wolfgang W.,Brucker Peter,Hoffman Alan J.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01585157.pdf

Reference13 articles.

1. Y.P. Aneja, R. Chandrasekaran and K.P.K. Nair, “Classes of linear programs with integral optimal solutions,”Mathematical Programming Study 25 (1985) 225–237.

2. W.W. Bein, “Netflows, polymatroids, and greedy structures,” Ph.D. Thesis, Universität Osnabrück (Osnabrück, Germany, 1986).

3. W.W. Bein and P. Brucker, “Greedy concepts for network flow problems,”Discrete Applied Mathematics 15 (1986) 135–144.

4. W.W. Bein, P. Brucker and A. Tamir, “Minimum cost flow algorithms for series parallel networks,”Discrete Applied Mathematics 10 (1985) 117–124.

5. P.C. Gilmore, E.L. Lawler and D.B. Shmoys, “Well-solved special cases,” in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds.,The Travelling Salesman Problem — A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985) pp. 87–143.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Integrality in the multinetwork min‐cost equal‐flow problem;Networks;2022-03-13

2. Generalized max flow in series–parallel graphs;Discrete Optimization;2013-05

3. What the transportation problem did for me;Annals of Operations Research;2006-12-02

4. On greedy algorithms, partially ordered sets, and submodular functions;IBM Journal of Research and Development;2003-01

5. Perspectives of Monge properties in optimization;Discrete Applied Mathematics;1996-09