A linear-time algorithm for solving continuous maximin knapsack problems
References (16)
Minimax linear programming
Oper. Res. Lett.
(1985)An O(n) algorithm for the linear multiple choice knapsack problem and related problems
Information Processing Lett.
(1984)- et al.
The Design and Analysis of Computer Algorithm
(1974) - et al.
An algorithm for large zero-one knapsack problems
Oper. Res.
(1980) An O(n) algorithm for the multiple-choice knapsack linear program
Math. Programming
(1984)Continuous maximin knapsack problems with GLB constraints
Math. Programming
(1986)- et al.
A branch search algorithm for the knapsack problems
Management Sci.
(1970) Application of programs with maximum objective functions to problems of optimal resource allocation
Oper. Res.
(1974)
There are more references available in the full text version of this article.
Cited by (26)
A hybrid heuristic for the 0-1 Knapsack Sharing Problem
2015, Expert Systems with ApplicationsCitation Excerpt :Two variants of the KSP exist in the literature: the continuous KSP and the binary KSP. The continuous KSP has been extensively studied by Tang (1988), Pang and Yu (1989), Brown (1991), Kuno, Konno, and Zemel (1991), Luss (1992) or Yamada and Futakawa (1997). A large variety of exact and approximate methods have been developed and adapted specifically for this problem.
New upper bounds and exact methods for the knapsack sharing problem
2014, Applied Mathematics and ComputationCitation Excerpt :Different exact and approximate approaches have been designed especially for this problem (Brown [4], Kuno et al. [11], Luss [12], Pang and Yu [14] and Tang [16]). For the particular continuous KSP, Kuno et al. [11] have proposed a linear time solution algorithm. Based on the same principle, Yamada and Futakawa [17] proposed an improved algorithm for the continuous KSP.
Nature plays with dice - terrorists do not: Allocating resources to counter strategic versus probabilistic risks
2009, European Journal of Operational ResearchSensitivity analysis of the knapsack sharing problem: Perturbation of the weight of an item
2008, Computers and Operations ResearchA pegging approach to the precedence-constrained knapsack problem
2007, European Journal of Operational ResearchAn exact algorithm for the knapsack sharing problem with common items
2006, European Journal of Operational Research
Copyright © 1991 Published by Elsevier B.V.