Skip to contents

Kellerer, Hans [Author]; Pferschy, Ulrich [Author]; Pisinger, David [Author] ; Kellerer, Hans G. [Other]

Knapsack problems : with 33 tables

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Berlin; Heidelberg [u.a.]: Springer, 2004
Dehne, Frank [Editor]; Iacono, John [Other]; Sack, Jörg-Rüdiger [Other] ; WADS 12 2011 New York, NY

Algorithms and data structures : 12th international symposium, WADS 2011, New York, NY, USA, August 15-17, 2011 ; proceedings

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Berlin; Heidelberg [u.a.]: Springer, 2011

Published in: Lecture notes in computer science ; 6844
Martello, Silvano [Author]; Toth, Paolo [Author]

Knapsack problems : algorithms and computer implementations

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

New York [u.a.]: Wiley & Sons, 1990

Published in: Wiley-Interscience series in discrete mathematics and optimization
Dawande, Milind [Author]; Kalagnanam, Jayant R. [Author]

The multiple knapsack problem with color constraints

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Almaden [u.a.]: IBM, 1998

Published in: Thomas J. Watson Research Center: Research report / RC ; 21138
Salman, F. Sibel [Author]; Kalagnanam, Jayant R. [Author]; Murthy, Sesh [Author]

Cooperative strategies for solving the bicriteria sparse multiple knapsack problem - [Rev.]

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Almaden [u.a.]: IBM, 1997

Published in: Thomas J. Watson Research Center: Research report / RC ; 21059,rev.
Salman, F. Sibel [Author]; Kalagnanam, Jayant R. [Author]; Murthy, Sesh [Author]

Heuristics for the bicriteria sparse multiple knapsack problem

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Almaden [u.a.]: IBM, 1997

Published in: Thomas J. Watson Research Center: Research report / RC ; 21059
Dempe, Stephan [Author]; Richter, Knut [Author]

Polynomial algorithm for a linear discontinuous knapsack problem

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Karl-Marx-Stadt: Techn. Hochschule, Sekt. Mathematik, 1981

Published in: Technische Hochschule Karl-Marx-Stadt: Wissenschaftliche Informationen / Technische Hochschule Karl-Marx-Stadt, Sektion Mathematik ; 25
Dawande, Milind [Author]; Kalagnanam, Jayant R. [Author]

A 4-approximation algorithm for the multiple knapsack problem with color constraints

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Almaden; Zurich [u.a.]: IBM, 1999

Published in: Thomas J. Watson Research Center: Research report / RC ; 21588
Heydrich, Sandy [Author] ; Stee, Rob van [Degree supervisor]

A tale of two packing problems : improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem

View online
Schließen

Access

https://d-nb.info/1164012193/34

kostenfrei

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Saarbrücken: Saarländische Universitäts- und Landesbibliothek, 2018
Kumabe, Soh [Author]; Yoshida, Yuichi [Author] ; Soh Kumabe and Yuichi Yoshida [Contributor]

Average Sensitivity of the Knapsack Problem

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
Jovanovic, Raka [Author]; Voss, Stefan [Author]

Fixed Set Search Matheuristic Applied to the Knapsack Problem with Forfeits

View online
Schließen

Access

https://ssrn.com/abstract=4450609

Full access (via DOI)

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

[S.l.]: SSRN, [2023]
Sun, Xiaoming [Author]; Zhang, Jialin [Author]; Zhang, Zhijie [Author] ; Xiaoming Sun and Jialin Zhang and Zhijie Zhang [Contributor]

Simple Deterministic Approximation for Submodular Multiple Knapsack Problem

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
Pape, Tom [Author]; Kavadias, Stelios [Author]; Sommer, Svenja C. [Author]

Decision Bias in Project Selection : Experimental Evidence from the Knapsack Problem

View online
Schließen

Access

Full access (via DOI)

https://ssrn.com/abstract=3448676

Show more show less

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

[S.l.]: SSRN, 2022
Pferschy, Ulrich [Author]; Schauer, Joachim [Author]; Thielen, Clemens [Author]

Approximating the product knapsack problem

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Berlin, Heidelberg: Springer, 2021
Eberle, Franziska [Author]; Megow, Nicole [Author]; Nölke, Lukas [Author]; Simon, Bertrand [Author]; Wiese, Andreas [Author] ; Franziska Eberle and Nicole Megow and Lukas Nölke and Bertrand Simon and Andreas Wiese [Contributor]

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
Böckenhauer, Hans-Joachim [Author]; Burjons, Elisabet [Author]; Hromkovič, Juraj [Author]; Lotze, Henri [Author]; Rossmanith, Peter [Author] ; Hans-Joachim Böckenhauer and Elisabet Burjons and Juraj Hromkovič and Henri Lotze and Peter Rossmanith [Contributor]

Online Simple Knapsack with Reservation Costs

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
Merino, Arturo [Author]; Wiese, Andreas [Author] ; Arturo Merino and Andreas Wiese [Contributor]

On the Two-Dimensional Knapsack Problem for Convex Polygons

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
Albers, Susanne [Author]; Khan, Arindam [Author]; Ladewig, Leon [Author] ; Susanne Albers and Arindam Khan and Leon Ladewig [Contributor]

Improved Online Algorithms for Knapsack and GAP in the Random Order Model

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
Han, Xin [Author]; Kawase, Yasushi [Author]; Makino, Kazuhisa [Author]; Yokomaku, Haruki [Author] ; Xin Han and Yasushi Kawase and Kazuhisa Makino and Haruki Yokomaku [Contributor]

Online Knapsack Problems with a Resource Buffer

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
Chan, Timothy M. [Author] ; Timothy M. Chan [Contributor]

Approximation Schemes for 0-1 Knapsack

View online
Schließen

Access

Close

Bookmarks

You can manage bookmarks using lists, please log in to your user account for this.

Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018

You did not find what you were looking for?

Purchase suggestion
Are you missing something you need for your research? If you have any suggestions please share them here.

Interlibrary Loan
Please search and order your favorite title in the Interlibrary Loan Portal.

Search in field:

Recently searched for:

You did not find what you were looking for?

> Year of publication

Year of publication