Linear time algorithms for some separable quadratic programming problems
暂无分享,去创建一个
[1] Dorit S. Hochbaum,et al. Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources , 1994, Math. Oper. Res..
[2] Takeshi Tokuyama,et al. Efficient algorithms for the Hitchcock transportation problem , 1992, SODA '92.
[3] 松井 知己. A Linear Time Algorithm for the Hitchcock Transportation Problem with Fixed Number of Supply Points , 1991 .
[4] Toshihide Ibaraki,et al. Resource allocation problems - algorithmic approaches , 1988, MIT Press series in the foundations of computing.
[5] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[6] Martin E. Dyer,et al. On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem , 1986, SIAM J. Comput..
[7] Kenneth L. Clarkson,et al. Linear Programming in O(n * (3_d)_2) Time , 1986, Information Processing Letters.
[8] P. Brucker. Review of recent development: An O( n) algorithm for quadratic knapsack problems , 1984 .
[9] Martin Dyer,et al. An O(n) algorithm for the multiple-choice knapsack linear program , 1984, Math. Program..
[10] Eitan Zemel,et al. An O(n) Algorithm for the Linear Multiple Choice Knapsack Problem and Related Problems , 1984, Inf. Process. Lett..
[11] Nimrod Megiddo,et al. Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.