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}
}

• R. Beier, Berthold Vöcking
• Published in SODA '04 2004
• Computer Science, Mathematics

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

View on ACM

cs.princeton.edu

Save to Library

Create Alert

Cite

Launch Research Feed