An empirical analysis of exact algorithms for the unbounded knapsack problem
From MaRDI portal
Publication:1735169
DOI10.1016/j.ejor.2019.02.011zbMath1430.90475arXiv1903.08936OpenAlexW2912385673WikidataQ128413133 ScholiaQ128413133MaRDI QIDQ1735169
Luciana S. Buriol, Henrique Becker
Publication date: 28 March 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.08936
integer programmingdynamic programmingcombinatorial optimizationbranch and boundunbounded knapsack problem
Related Items (2)
Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- An exact algorithm for large unbounded knapsack problems
- A hybrid algorithm for the unbounded knapsack problem
- On equivalent knapsack problems
- A better step-off algorithm for the knapsack problem
- On dominated terms in the general knapsack problem
- Unbounded knapsack problem: Dynamic programming revisited
- BPPLIB: a library for bin packing and cutting stock problems
- Dual Inequalities for Stabilized Column Generation Revisited
- The Unbounded Knapsack Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Finite Renewal Algorithm for the Knapsack and Turnpike Models
- The Theory and Computation of Knapsack Functions
- An Enumeration Algorithm for Knapsack Problems
This page was built for publication: An empirical analysis of exact algorithms for the unbounded knapsack problem
