- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Improved Online Algorithms for Knapsack and GAP in the Random Order Model ; day:17 ; month:2 ; year:2021 ; pages:1-36
Algorithmica ; (17.2.2021), 1-36
- Creator
-
Albers, Susanne
Khan, Arindam
Ladewig, Leon
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-021-00801-2
- URN
-
urn:nbn:de:101:1-2021040622435108005025
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:50 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Albers, Susanne
- Khan, Arindam
- Ladewig, Leon
- SpringerLink (Online service)
Other Objects (12)
Approximation Algorithms for 3D Orthogonal Knapsack
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
An Improved Approximation Algorithm for Knapsack Median Using Sparsification
Comparison of Multiobjective Memetic Algorithms on 0/1 Knapsack Problems
On the average behaviour of greedy algorithms for the knapsack problem
Algorithms for Municipal Flood Mitigation, Related Interdiction Problems, and Knapsack Problems
"A.Y.H. Knapsack"
A tale of two packing problems : improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem
The average behaviour of greedy algorithms for the knapsack problem: Computational experiments
The average behaviour of greedy algorithms for the knapsack problem: General distributions
A biased random-key genetic algorithm for the knapsack problem with forfeit sets
Knapsack, St. Josef
Approximation Algorithms for 3D Orthogonal Knapsack
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
An Improved Approximation Algorithm for Knapsack Median Using Sparsification
Comparison of Multiobjective Memetic Algorithms on 0/1 Knapsack Problems
On the average behaviour of greedy algorithms for the knapsack problem
Algorithms for Municipal Flood Mitigation, Related Interdiction Problems, and Knapsack Problems
"A.Y.H. Knapsack"
A tale of two packing problems : improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem
The average behaviour of greedy algorithms for the knapsack problem: Computational experiments
The average behaviour of greedy algorithms for the knapsack problem: General distributions
A biased random-key genetic algorithm for the knapsack problem with forfeit sets
Knapsack, St. Josef
Approximation Algorithms for 3D Orthogonal Knapsack
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
An Improved Approximation Algorithm for Knapsack Median Using Sparsification
Comparison of Multiobjective Memetic Algorithms on 0/1 Knapsack Problems
On the average behaviour of greedy algorithms for the knapsack problem
Algorithms for Municipal Flood Mitigation, Related Interdiction Problems, and Knapsack Problems
"A.Y.H. Knapsack"
A tale of two packing problems : improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem
The average behaviour of greedy algorithms for the knapsack problem: Computational experiments
The average behaviour of greedy algorithms for the knapsack problem: General distributions
A biased random-key genetic algorithm for the knapsack problem with forfeit sets