An application of simultaneous diophantine approximation in combinatorial optimization-Reference-Cited by-同舟云学术

An application of simultaneous diophantine approximation in combinatorial optimization

Published:1987-03 Issue:1 Volume:7 Page:49-65
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Frank András,Tardos Éva

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

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

Reference19 articles.

1. R. E. Bixby, O. M.-C. Marcotte andL. E. Trotter, Jr., Packing and covering with integral flows in integral supply-demand networks,Report No. 84327—OR, Institut für Ökonometrie und Operations Research, University Bonn, Bonn, West Germany.

2. J. W. S. Cassels,An Introduction to the Theory of Numbers, Berlin, Heidelberg, New York, Springer, 1971.

3. W. H. Cunningham, Testing membership in matroid polyhedra,Journal of Combinatorial Theory B,36 (1984), 161–188.

4. W. H. Cunningham andA. Frank, A primal dual algorithm for submodular flows,Mathematics of Operations Research.,10 (1985).

5. E. A. Dinits, Algorithm for solution of a problem of maximum flow in a network with power estimation,Soviet Math. Dokl.,11 (1970), 1277–1280.

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

1. The Maximum Zero-Sum Partition problem;Theoretical Computer Science;2024-12

2. Packing arc-disjoint cycles in oriented graphs;Journal of Computer and System Sciences;2024-08

3. Parameterized complexity for iterated type partitions and modular-width;Discrete Applied Mathematics;2024-06

4. On coresets for fair clustering in metric and Euclidean spaces and their applications;Journal of Computer and System Sciences;2024-06

5. From approximate to exact integer programming;Mathematical Programming;2024-04-24