Publisher
Springer Science and Business Media LLC
Reference12 articles.
1. Alfakih A.Y., Yi T., Murty K.G.: Facets of an assignment problem with a 0 − 1 side constraint. J. Comb. Optim. 4, 365–388 (2000)
2. Avis D., Fukuda K.: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Comput. Geometry 8, 295–313 (1992)
3. Dantzig G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)
4. Grünbaum B.: Covex Polytopes. Wiley Interscience, New York (1967)
5. Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., Gurvich, V.: Generating All Vertices of a polyhedron is Hard. RUTCOR, Rutgers University (2006)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献