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

DOI10.1016/j.disopt.2023.100771zbMath1527.90185OpenAlexW4323687936MaRDI QIDQ6108919

Jan Boeckmann, Ulrich Pferschy, Clemens Thielen

Publication date: 30 June 2023

Published in: Discrete Optimization (Search for Journal in Brave)

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

zbMATH Keywords

approximation schemenonlinear knapsack problemmulti-objective knapsack problemproduct knapsack problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristic algorithms for the general nonlinear separable knapsack problem
• Nonconvex piecewise linear knapsack problems
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Approximation algorithms for the capacitated plant allocation problem
• The nonlinear knapsack problem - algorithms and applications
• On strong NP-completeness of rational problems
• Relaxations and heuristics for the multiple non-linear separable knapsack problem
• On the product knapsack problem
• Approximation of the quadratic knapsack problem
• A nonlinear knapsack problem
• Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• 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
• Exact algorithms for the 0-1 time-bomb knapsack problem
• Approximating the product knapsack problem
• Bi-criteria path problem with minimum length and maximum survival probability
• Approximation schemes for \(r\)-weighted minimization knapsack problems
• Approximating Multiobjective Knapsack Problems
• Approximation of the Quadratic Knapsack Problem
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• Approximation Methods for Multiobjective Optimization Problems: A Survey
• Multicriteria Optimization
• Progress in mathematical programming solvers from 2001 to 2020

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