An exact algorithm for the 0-1 collapsing knapsack problem
type: Item
instance of: scholarly article
title: An exact algorithm for the 0-1 collapsing knapsack problem
zbMATH Open document ID: 0806.90089
DOI: 10.1016/0166-218X(94)90208-9
author: Didier Fayard
author: Gérard Plateau
published in: Discrete Applied Mathematics
publication date: 1994-06-15T00:00:00Z
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 590202
zbMATH Keywords: satellite communications
zbMATH Keywords: 0-1 collapsing knapsack problem
zbMATH Keywords: implicit enumeration
MaRDI profile type: Publication
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: Q3661315
cites work: An algorithm for the solution of the 0-1 knapsack problem
cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
cites work: Fast Approximation Algorithms for Knapsack Problems
cites work: A New Algorithm for the 0-1 Knapsack Problem
cites work: The Collapsing 0–1 Knapsack Problem
full work available at URL: 0166-218x(94)90208-9
OpenAlex ID: W2022526624
description: scientific article; zbMATH DE number 590202