Approximation issues of fractional knapsack with penalties: a note

DOI10.1007/S10288-021-00474-1zbMath1493.90160OpenAlexW3131354238MaRDI QIDQ2144213

Sergey Kovalev

Publication date: 1 June 2022

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-021-00474-1

zbMATH Keywords

computational complexityknapsack problemfully polynomial-time approximation scheme

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Integer knapsack problems with profit functions of the same value range

Cites Work

• Unnamed Item
• Mathematical programming algorithms for bin packing problems with item fragmentation
• Online scheduling with preemption or non-completion penalties
• Integer optimization with penalized fractional values: the knapsack case
• An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note
• Improving the complexities of approximation algorithms for optimization problems
• Minimizing total completion time subject to job release dates and preemption penalties
• The ADMM Penalized Decoder for LDPC Codes
• A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
• Vehicle routing problems with split deliveries

This page was built for publication: Approximation issues of fractional knapsack with penalties: a note