A fast algorithm for strongly correlated knapsack problems
type: Item
instance of: scholarly article
title: A fast algorithm for strongly correlated knapsack problems
zbMATH Open document ID: 0921.90122
DOI: 10.1016/S0166-218X(98)00127-9
author: David Pisinger
published in: Discrete Applied Mathematics
publication date: 1999-03-22T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 1267551
zbMATH Keywords: fixed-charge problem
zbMATH Keywords: memorization
zbMATH Keywords: exact algorithm
zbMATH Keywords: subset-sum problem
zbMATH Keywords: strongly correlated knapsack-problems
zbMATH Keywords: 0--1 knapsack problem
zbMATH Keywords: surrogate relaxation
zbMATH Keywords: 2-optimal heuristic
zbMATH Keywords: dynamic programming
Wikidata QID: Q58826511
describes a project that uses: Knapsack
MaRDI profile type: Publication
cites work: Facets of the knapsack polytope
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
cites work: A lexicographic search for strongly correlated 0-1 knapsack problems
cites work: Simple but efficient approaches for the collapsing knapsack problem
cites work: An expanding-core algorithm for the exact \(0-1\) knapsack problem
cites work: A Minimal Algorithm for the 0-1 Knapsack Problem
cites work: Q4245749
DBLP publication ID: journals/dam/Pisinger98
description: scientific article; zbMATH DE number 1267551