Author:
Barahona Francisco,Mahjoub Ali Ridha
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference9 articles.
1. F. Barahona, “On the computational complexity of Ising spin glass models,”Journal of Physics A Mathematics and General 15 (1982) 3241–3250.
2. F. Barahona, “The max cut problem in graphs not contractible toK 5,”Operations Research Letters 2 (1983) 107–111.
3. F. Barahona, M. Grötschel and A.R. Mahjoub, “Facets of the bipartite subgraph polytope,”Mathematics of Operations Research 10 (1985) 340–358.
4. M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).
5. M. Grötschel, L. Lovász and A. Schrijver, “The ellipsoid method and its consequences in combinatorial optimization,”Combinatorica 1 (1981) 169–197.
Cited by
281 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献