Empirical comparison of four MOEAs on bi-objective stochastic MKP with chance constraints and dynamic capacities shows differences in behavior across uncertainty levels and change frequencies.
A polynomial time approximation scheme for the multiple knapsack problem.SIAM Journal on Computing, 35(3):713–728
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NE 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Use of Bi-Objective Evolutionary Algorithms for the Stochastic MKP under Dynamic Constraints
Empirical comparison of four MOEAs on bi-objective stochastic MKP with chance constraints and dynamic capacities shows differences in behavior across uncertainty levels and change frequencies.