An exact algorithm for the 0-1 collapsing knapsack problem

DOI10.1016/0166-218X(94)90208-9zbMath0806.90089OpenAlexW2022526624MaRDI QIDQ1327229

Didier Fayard, Gérard Plateau

Publication date: 15 June 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90208-9

zbMATH Keywords

satellite communicationsimplicit enumeration0-1 collapsing knapsack problem

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (7)

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 ⋮ Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem ⋮ An efficient algorithm for the collapsing knapsack problem ⋮ The continuous collapsing Knapsack problem ⋮ An efficient tabu search approach for the 0-1 multidimensional knapsack problem

Cites Work

• Unnamed Item
• An algorithm for the solution of the 0-1 knapsack problem
• A New Algorithm for the 0-1 Knapsack Problem
• Fast Approximation Algorithms for Knapsack Problems
• An Algorithm for Large Zero-One Knapsack Problems
• The Collapsing 0–1 Knapsack Problem
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem

This page was built for publication: An exact algorithm for the 0-1 collapsing knapsack problem