Integer optimization with penalized fractional values: the knapsack case

DOI10.1016/J.EJOR.2018.09.020MaRDI QIDQ1631508zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Enrico Malaguti, Michele Monaci, Paolo Paronuzzi, 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

zbMATH Keywords

approximation algorithmscomputational experimentsdynamic programmingknapsack problempacking

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Recommendations

• Approximation issues of fractional knapsack with penalties: a note
• An optimization algorithm for a penalized knapsack problem
• New exact approaches and approximation results for the penalized knapsack problem
• Approximation algorithms for fractional knapsack problems
• Approximate and exact algorithms for the fixed-charge knapsack problem

Cites work

• A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
• A minimal algorithm for the multiple-choice knapsack problem
• An optimization algorithm for a penalized knapsack problem
• Benchmarking optimization software with performance profiles.
• Complexity of fragmentable object bin packing and an application
• Discrete dynamic programming and capital allocation
• Exactly solving packing problems with fragmentation
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Mathematical programming algorithms for bin packing problems with item fragmentation
• Random knapsack in expected polynomial time
• Scheduling. Theory, algorithms, and systems.
• The nonlinear knapsack problem - algorithms and applications
• Vehicle routing problems with split deliveries
• Where are the hard knapsack problems?

Cited in

(13)

• New exact approaches and approximation results for the penalized knapsack problem
• The continuous knapsack problem with capacities
• Approximation issues of fractional knapsack with penalties: a note
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• The fractional multidimensional knapsack problem: solution and uniqueness
• A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments
• An optimization algorithm for a penalized knapsack problem
• 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
• Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation
• Partitioning problems with splittings and interval targets
• Algorithms and complexity results for the 0-1 knapsack problem with group fairness

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: Integer optimization with penalized fractional values: the knapsack case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1631508)