Author:
Pardalos Panos M,Prokopyev Oleg A,Busygin Stanislav
Publisher
Kluwer Academic Publishers
Reference67 articles.
1. J. Abello, S. Butenko, P.M. Pardalos, and M.G.C. Resende, Finding independent sets in a graph using continuous multivariable polynomial formulations, Journal of Global Optimization 21/4 (2001), pp. 111–137.
2. F. Alizadeh, Optimization Over Positive Semi-Definite Cone: Interrior-Point Methods and Combinatorial Optimization, in: P.M. Pardalos, ed., Advances in Optimization and Parallel Computing, North-Holland, 1992, pp. 1–25.
3. F. Alizadeh, Interrior-Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization, SIAM J. Opt. Vol. 5 (1995), pp. 13–51.
4. S.J. Benson, Y. Ye, X. Zhang, Solving large-scale semidefinite programs for combinatorial optimization, SIAM J. Optim. Vol. 10/2 (2000) pp. 443–461.
5. I.M. Bomze, M. Budinich, P.M. Pardalos, and M. Pelillo, The maximum clique problem, in: D.-Z. Du and P.M. Pardalos, eds., Handbook of Combinatorial Optimization (Supplement Volume A), Kluwer Academic (1999), 1–74.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献