An experimental study of random knapsack problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimentally investigate the number of Pareto points for knapsack instances over n elements whose profits and weights are chosen...
|Published in:||Algorithmica : an international journal in computer science, Vol. 45, No. 1 (2006), p. 121-136|
|Other Involved Persons:|
|Item Description:||This research was supported in part by the EU within the 6th Framework Programme under Contract 0019007 (DELIS), by DFG Grant Vo889/2-1, and by a postdoctoral fellowship by the German Academic Exchange Service (DAAD).|
|QR Code:||Show QR Code|