Author:
Bárány I.,Wolsey L. A.,Edmonds J.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference7 articles.
1. I. Bárány, T. J. Van Roy, andL. A. Wolsey, Uncapacitated Lot-Sizing: The Convex Hull-of Solutions,Mathematical Programming Study,22 (1984), 32–43.
2. A. Frank, Some Polynomial Algorithms for Certain Graphs and Hypergraphs,Proceedings of the 5th British Combinatorial Conference, Congressus Numerantium XV,Utilitas Math., Winnipeg (1976).
3. F. Gavril, The intersection Graphs of Subtrees in Trees are Exactly the Chordal Graphs,Journal of Combinatorial Theory, B 16, (1974), 47–56.
4. M. C. Golumbic,Algorithmic Graph Theory and Perfect Graphs, Academic Press, (1980).
5. H. Gröflin andT. M. Liebling, Connected and Alternating Vectors: Polyhedra and Algorithms,Mathematical Programming,20 (1981), 233–244.
Cited by
44 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site Location;Lecture Notes in Computer Science;2024
2. The game of Cops and Eternal Robbers;Theoretical Computer Science;2021-05
3. Collaboration in Transport and Logistics Networks;Network Design with Applications to Transportation and Logistics;2020-12-09
4. References;Integer Programming;2020-09-19
5. Gain-sharing in urban consolidation centers;European Journal of Operational Research;2019-12