A minimal algorithm for the Bounded Knapsack Problem

DOI10.1007/3-540-59408-6_44zbMath1498.90200OpenAlexW1570738145MaRDI QIDQ5101408

David Pisinger

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59408-6_44

zbMATH Keywords

expanding core problemsorting and reduction

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

A heuristic for the problem of one-dimensional steel coil cutting ⋮ Supercomputer Scheduling with Combined Evolutionary Techniques

Uses Software

• Knapsack
• Quicksort

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A minimal algorithm for the multiple-choice knapsack problem
• An expanding-core algorithm for the exact \(0-1\) knapsack problem
• Discrete Dynamic Programming and Capital Allocation
• A New Algorithm for the 0-1 Knapsack Problem
• An Algorithm for Large Zero-One Knapsack Problems
• A General Algorithm for One-Dimensional Knapsack Problems
• The Theory and Computation of Knapsack Functions
• Quicksort

This page was built for publication: A minimal algorithm for the Bounded Knapsack Problem