Author:
Escudero L. F.,Martello S.,Toth P.
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. A.L. Brearly, G. Mitra and H.P. Williams, Analysis of mathematical programming problems prior to applying the Simplex algorithm, Mathematical Programming 8 (1975) 54–83.
2. E. Balas, Facets of the knapsack polytope, Mathematical Programming 8 (1975) 146–164.
3. E. Balas and E. Zemel, Facets of the knapsack polytope from minimal covers, SIAM J. of Applied Mathematics 39 (1978) 119–148.
4. H. Crowder, E.L. Johnson and M.W. Padberg, Solving large-scale zero-one linear programming problems, Operations Research 31 (1983) 803–834.
5. B.L. Dietrich, L.F. Escudero, A. Garín and G. Pérez, O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates, TOP Trabajos de Investigación-Operativa 1 (1993) 139–160.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献