Approximating single- and multi-objective nonlinear sum and product knapsack problems
type: Item
instance of: scholarly article
title: Approximating single- and multi-objective nonlinear sum and product knapsack problems
zbMATH Open document ID: 1527.90185
author: Jan Boeckmann
author: Clemens Thielen
author: Ulrich Pferschy
published in: Discrete Optimization
publication date: 2023-06-30T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 7705141
zbMATH Keywords: nonlinear knapsack problem
zbMATH Keywords: approximation scheme
zbMATH Keywords: product knapsack problem
zbMATH Keywords: multi-objective knapsack problem
MaRDI profile type: MaRDI publication profile
full work available at URL: j.disopt.2023.100771
OpenAlex ID: W4323687936
cites work: Progress in mathematical programming solvers from 2001 to 2020
cites work: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
cites work: Q4902563
cites work: On the product knapsack problem
cites work: Q4821303
cites work: Knapsack problems -- an overview of recent advances. I: Single knapsack problems
cites work: Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
cites work: Q5091235
cites work: Multicriteria Optimization
cites work: Approximation Methods for Multiobjective Optimization Problems: A Survey
cites work: Exact algorithms for the 0-1 time-bomb knapsack problem
cites work: The nonlinear knapsack problem - algorithms and applications
cites work: Q3123417
cites work: A nonlinear knapsack problem
cites work: Heuristic algorithms for the general nonlinear separable knapsack problem
cites work: Relaxations and heuristics for the multiple non-linear separable knapsack problem
cites work: Bi-criteria path problem with minimum length and maximum survival probability
cites work: Approximating the product knapsack problem
cites work: On strong NP-completeness of rational problems
cites work: Q3802899
cites work: Approximating Multiobjective Knapsack Problems
cites work: Nonconvex piecewise linear knapsack problems
cites work: Approximation algorithms for the capacitated plant allocation problem
cites work: Approximation schemes for \(r\)-weighted minimization knapsack problems
cites work: Q3050129
cites work: Q3988807
cites work: Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey
cites work: Approximation of the quadratic knapsack problem
cites work: Approximation of the Quadratic Knapsack Problem
DOI: 10.1016/J.DISOPT.2023.100771
description: scientific article; zbMATH DE number 7705141