Basic 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 2 in Knapsack Problems, 2004, pp 15-42 from Springer

Abstract: Abstract In this chapter we introduce some algorithmic ideas which will be used in more elaborate ways in various chapters for different problems. The aim of presenting these ideas in a simple form is twofold. On one hand we want to provide the reader, who is a novice in the area of knapsack problems or combinatorial and integer programming in general, with a basic introduction such that no other reference is needed to work successfully with the more advanced algorithms in the remainder of this book. On the other hand, we would like to establish a common conceptual cornerstone from which the other chapters can develop the more refined variants of these basic ideas as they are required for each of the individual problems covered there. In this way we can avoid repetitions without affecting the self-contained character of the remaining chapters.

Keywords: Dynamic Programming; Approximation Algorithm; Problem Instance; Algorithm Greedy; Knapsack Problem (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_2

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

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

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 ().