Author:
Grötschel Martin,Jünger Michael,Reinelt Gerhard
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference8 articles.
1. M.R. Garey and D.S. Johnson,Computers and intractability: A guide to the theory of NP-completeness (Freeman, San Francisco, 1979).
2. M. Grötschel, M. Jünger and G. Reinelt, “Facets of the linear ordering polytope”, this volume, pp. xx–yy.
3. M. Grötschel, M. Jünger and G. Reinelt, “A cutting plane algorithm for the linear ordering problem”,Operations Research 32 (1984) 1195–1220.
4. M. Grötschel, M. Jünger and G. Reinelt, “Optimal triangulation of large real-world input-outputmatrices”,Statistische Hefte 25 (1984) 261–295.
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
79 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献