Generalized polymatroids and submodular flows-Reference-Cited by-同舟云学术

Generalized polymatroids and submodular flows

Published:1988-04 Issue:1-3 Volume:42 Page:489-563
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Frank András,Tardos Éva

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

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

Reference86 articles.

1. E. Balas, “A linear characterization of permutation vectors,” Management Science Research Report No. 364, Carnegie-Mellon University, Pittsburgh, PA (1975).

2. E. Balas and W. Pulleyblank, “The perfectly matchable subgraph polytope of bipartite graphs,”Networks 13 (1983) 495–516.

3. R.E. Bixby, W.H. Cunningham and D.M. Topkis, “The partial order of a polymatroid extreme point,”Mathematics of Operations Research 10 (1985) 367–378.

4. O. Boruvka, “O jistém problému minimálnim“ (with extended abstract in German),Acte Societatis Scientiarium Naturalium Moravicae, Tomus III, Fasc. 3, Signature F23 (1926) 37–58.

5. Cai Mao-Cheng, “Arc-disjoint arborescences of diagraphs,”Journal of Graph Theory 7 (1983) 235–240.

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

1. Arc Connectivity and Submodular Flows in Digraphs;Combinatorica;2024-05-28

2. A 3/2-Approximation for the Metric Many-Visits Path TSP;SIAM Journal on Discrete Mathematics;2022-12

3. Note on the polyhedral description of the Minkowski sum of two L-convex sets;Japan Journal of Industrial and Applied Mathematics;2022-06-11

4. Compression of M♮-convex functions — Flag matroids and valuated permutohedra;Journal of Combinatorial Theory, Series A;2022-01

5. Decreasing minimization on M-convex sets: algorithms and applications;Mathematical Programming;2021-10-15