Integer optimization with penalized fractional values: the knapsack case
From MaRDI portal
Publication:1631508
DOI10.1016/j.ejor.2018.09.020zbMath1403.90579OpenAlexW2892881076WikidataQ61638283 ScholiaQ61638283MaRDI QIDQ1631508
Paolo Paronuzzi, Enrico Malaguti, Michele Monaci, Ulrich Pferschy
Publication date: 6 December 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.09.020
Related Items (8)
New exact approaches and approximation results for the penalized knapsack problem ⋮ Approximation issues of fractional knapsack with penalties: a note ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Integer knapsack problems with profit functions of the same value range ⋮ One-dimensional stock cutting resilient against singular random defects ⋮ Corrigendum to: ``Integer optimization with penalized fractional values: the knapsack case ⋮ The continuous knapsack problem with capacities ⋮ A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mathematical programming algorithms for bin packing problems with item fragmentation
- Exactly solving packing problems with fragmentation
- A minimal algorithm for the multiple-choice knapsack problem
- The nonlinear knapsack problem - algorithms and applications
- Complexity of fragmentable object bin packing and an application
- Where are the hard knapsack problems?
- An optimization algorithm for a penalized knapsack problem
- Discrete Dynamic Programming and Capital Allocation
- A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
- Vehicle routing problems with split deliveries
- Scheduling
- Random knapsack in expected polynomial time
- Benchmarking optimization software with performance profiles.
This page was built for publication: Integer optimization with penalized fractional values: the knapsack case
