The Collapsing 0–1 Knapsack Problem

DOI10.1007/BF01609014zbMath0393.90060OpenAlexW2022879050MaRDI QIDQ4175049

Marc E. Posner, Monique Guignard

Publication date: 1978

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01609014

zbMATH Keywords

AlgorithmComputational EfficiencyBranch-Search ApproachCollapsing Knapsack Problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Boolean programming (90C09)

Related Items (8)

An exact algorithm for the 0-1 collapsing knapsack problem ⋮ Simple but efficient approaches for the collapsing knapsack problem ⋮ A dual approach for the continuous collapsing knapsack problem ⋮ A new exact approach for the 0-1 collapsing knapsack problem ⋮ An efficient algorithm for the collapsing knapsack problem ⋮ On a cardinality constrained linear programming knapsack problem ⋮ Approximation algorithms for knapsack problems with cardinality constraints ⋮ The continuous collapsing Knapsack problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reduction Algorithm for Zero-One Single Knapsack Problems
• An Efficient Algorithm for the 0-1 Knapsack Problem
• An Algorithm for Nonlinear Knapsack Problems
• Pseudo-Boolean Programming
• An Improved Implicit Enumeration Approach for Integer Programming
• A Branch Search Algorithm for the Knapsack Problem
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• Mixed-integer Algorithms for the (0,1) Knapsack Problem

This page was built for publication: The Collapsing 0–1 Knapsack Problem