AnO(n2) active set method for solving a certain parametric quadratic program
暂无分享,去创建一个
[1] Michel Balinski,et al. A competitive (dual) simplex method for the assignment problem , 1986, Math. Program..
[2] Michael J. Best,et al. Equivalence of some quadratic programming algorithms , 1984, Math. Program..
[3] P. Brucker. Review of recent development: An O( n) algorithm for quadratic knapsack problems , 1984 .
[4] Michael J. Best,et al. Active set algorithms for isotonic regression; A unifying framework , 1990, Math. Program..
[5] S. Yitzhaki. A tax programming model , 1982 .
[6] Philip E. Gill,et al. Practical optimization , 1981 .
[7] Ming S. Hung,et al. Technical Note - A Polynomial Simplex Method for the Assignment Problem , 1983, Oper. Res..
[8] J. Orlin. Working Paper Alfred P. Sloan School of Management Genuinely Polynominal Simplex and Non-simplex Algorithms for the Minimum Cost Flow Problem Genuinely Polynominal Simplex and Non-simplex Algorithms for the Minimum Cost Flow Problem , 2008 .
[9] Jeffery L. Kennington,et al. A polynomially bounded algorithm for a singly constrained quadratic program , 1980, Math. Program..
[10] M. Best,et al. A parameterized hessian quadratic programming problem , 1986 .