Approximating single- and multi-objective nonlinear sum and product knapsack problems

DOI10.1016/J.DISOPT.2023.100771MaRDI QIDQ6108919zbMATH OpenOpenAlexFDO

Authors Jan Boeckmann, Clemens Thielen, Ulrich Pferschy

Publication date 30 June 2023

Published in Discrete Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.disopt.2023.100771

zbMATH Keywords

approximation schememulti-objective knapsack problemnonlinear knapsack problemproduct knapsack problem

Mathematics Subject Classification ID

Boolean programming (90C09) Combinatorial optimization (90C27) Multi-objective and goal programming (90C29)

Recommendations

• A nonlinear knapsack problem
• scientific article; zbMATH DE number 1830735
• Approximation for knapsack problems with multiple constraints
• Approximating the product knapsack problem
• Implementing an efficient fptas for the 0-1 multi-objective knapsack problem

Cites work

• A nonlinear knapsack problem
• Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
• Approximating multiobjective knapsack problems
• Approximating the product knapsack problem
• Approximation algorithms for the capacitated plant allocation problem
• Approximation Methods for Multiobjective Optimization Problems: A Survey
• Approximation of the quadratic knapsack problem
• Approximation of the quadratic knapsack problem
• Approximation schemes for \(r\)-weighted minimization knapsack problems
• Bi-criteria path problem with minimum length and maximum survival probability
• Exact algorithms for the 0-1 time-bomb knapsack problem
• Heuristic algorithms for the general nonlinear separable knapsack problem
• scientific article; zbMATH DE number 3644795 (Why is no real title available?)
• scientific article; zbMATH DE number 988191 (Why is no real title available?)
• scientific article; zbMATH DE number 4070651 (Why is no real title available?)
• scientific article; zbMATH DE number 33203 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• scientific article; zbMATH DE number 7561569 (Why is no real title available?)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Microeconomic theory
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• Multicriteria Optimization
• Nonconvex piecewise linear knapsack problems
• On strong NP-completeness of rational problems
• On the product knapsack problem
• Progress in mathematical programming solvers from 2001 to 2020
• Relaxations and heuristics for the multiple non-linear separable knapsack problem
• The nonlinear knapsack problem - algorithms and applications
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

Cited in

(3)

• Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
• scientific article; zbMATH DE number 2097195 (Why is no real title available?)
• Algorithms and complexity results for the 0-1 knapsack problem with group fairness

This page was built for publication: Approximating single- and multi-objective nonlinear sum and product knapsack problems

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