Corpus ID: 11162418

Probabilistic analysis of knapsack core algorithms

@inproceedings{Beier2004ProbabilisticAO,
  title={Probabilistic analysis of knapsack core algorithms},
  author={R. Beier and Berthold V{\"o}cking},
  booktitle={SODA '04},
  year={2004}
}
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic concept used in practice. These algorithms start with the computation of an optimal fractional solution that has only one fractional item and then they exchange items until an optimal integral solution is found. The idea is that in many cases the optimal integral solution should be close to the fractional one such that only… Expand
22 Citations
An experimental study of random knapsack problems
  • 11
  • PDF
An Experimental Study of Random Knapsack Problems
  • 4
Probabilistic analysis of discrete optimization problems
  • R. Beier
  • Mathematics, Computer Science
  • 2004
  • 11
  • PDF
Branch-and-Bound Solves Random Binary Packing IPs in Polytime
  • 2
  • PDF
Smoothed Analysis of Integer Programming
  • 19
  • PDF
Smoothed analysis of integer programming
  • 27
Branch-and-Bound Solves Random Binary IPs in Polytime
  • 1
  • PDF
On Local Search for Bi-objective Knapsack Problems
  • 14
  • Highly Influenced
Development of core to solve the multidimensional multiple-choice knapsack problem
  • 27
  • PDF
Typical properties of winners and losers in discrete optimization
  • 72
  • PDF
...
1
2
3
...

References

SHOWING 1-6 OF 6 REFERENCES
An Algorithm for Large Zero-One Knapsack Problems
  • 456
  • Highly Influential
On the Average Difference between the Solutions to Linear and Integer Knapsack Problems
  • 33
  • Highly Influential
New trends in exact algorithms for the 0-1 knapsack problem
  • 297
  • Highly Influential
  • PDF
On finding the exact solution of a zero-one knapsack problem
  • 46
  • Highly Influential
V̈ocking. Random Knapsack in Expected Polynomial Time.Proceedings of the 35th
  • ACM Symposium on Theory of Computing
  • 2003
Algorithms for Knapsack Problems
  • 308
  • Highly Influential
  • PDF