Structures of polyhedra determined by submodular functions on crossing families-Reference-Cited by-同舟云学术

Structures of polyhedra determined by submodular functions on crossing families

Published:1984-06 Issue:2 Volume:29 Page:125-141
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Fujishige Satoru

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

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

Reference18 articles.

1. J. Edmonds, “Submodular functions, matroids, and certain polyhedra”. Proceedings of the Calgary International Conference on Combinatorial Structures and Their Applications (Gordon and Breach, New York, 1970), pp. 69–87.

2. J. Edmonds and R. Giles, “A min-max relation for submodular functions on graphs”,Annals of Discrete Mathematics 1 (1977) 185–204.

3. A. Frank, “An algorithm for submodular functions on graphs”,Annals of Discrete Mathematics 16 (1982) 189–212.

4. A. Frank, “Finding feasible vectors of Edmonds-Giles polyhedra”, Report No. 81205-0R, Institut für Ökonometrie und Operations Research, Universität Bonn (September 1981).

5. s. Fujishige, “A primal approach to the independent assignment problem”Journal of the Operations Research Society of Japan 20 (1977) 1–15.

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

1. On Packing Dijoins in Digraphs and Weighted Digraphs;SIAM Journal on Discrete Mathematics;2023-10-19

2. Fair integral submodular flows;Discrete Applied Mathematics;2022-10

3. A Class of Convex Quadratic Nonseparable Resource Allocation Problems with Generalized Bound Constraints;INFORMS Journal on Optimization;2022-04

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

5. Determining Optimal Rates for Communication for Omniscience;IEEE Transactions on Information Theory;2018-03