Advanced Algorithmic Concepts

Hans Kellerer (), Ulrich Pferschy () and David Pisinger ()
Additional contact information
Hans Kellerer: University of Graz, Department of Statistics and Operations Research
Ulrich Pferschy: University of Graz, Department of Statistics and Operations Research
David Pisinger: University of Copenhagen, DIKU, Department of Computer Science

Chapter 3 in Knapsack Problems, 2004, pp 43-72 from Springer

Abstract: Abstract There are several more technical algorithmic aspects which are useful tools for many of the algorithms presented throughout this book. Although some of them may be seen only as implementational details, others are nice algorithmic and structural ideas on their own. Both of these categories are frequently crucial to derive the claimed running time bounds. We will try to present them as “black boxes” which means that we state explicitly a certain algorithmic property or a feature to be used by algorithms thereafter. The corresponding detailed description or justification is given for the interested reader but may be omitted without loss of understanding in the remaining chapters.

Keywords: Knapsack Problem; Valid Inequality; Minimal Cover; Balance Solution; Open Node (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-24777-7_3

Ordering information: This item can be ordered from
http://www.springer.com/9783540247777

DOI: 10.1007/978-3-540-24777-7_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().