On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem

DOI10.1007/S00186-020-00702-0MaRDI QIDQ2216176zbMATH OpenOpenAlexFDO

Authors Britta Schulze, Michael Stiglmayr, Luís Paquete, Carlos M. Fonseca, David Willems, Stefan Ruzika

Publication date 15 December 2020

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00186-020-00702-0

zbMATH Keywords

approximation algorithmhypervolumemultiobjective combinatorial optimizationquadratic knapsack problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• On the rectangular knapsack problem
• On the two-dimensional knapsack problem
• Quadratic bottleneck knapsack problems
• Approximating the product knapsack problem
• Approximation of the quadratic knapsack problem

Cites work

• 0-1 quadratic knapsack problems: an exact approach based on a t-linearization
• A new upper bound for the 0-1 quadratic knapsack problem
• A Selection Problem of Shared Fixed Costs and Network Flows
• A semidefinite programming approach to the quadratic knapsack problem
• A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• Approximation of the quadratic knapsack problem
• Approximation of the quadratic knapsack problem
• Exact Solution of the Quadratic Knapsack Problem
• Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1302195 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Introduction to algorithms
• Linear programming for the \(0-1\) quadratic knapsack problem
• Min-cut clustering
• Quadratic knapsack problems
• Solution of large quadratic knapsack problems through aggressive reduction
• The quadratic 0-1 knapsack problem with series-parallel support
• The quadratic knapsack problem -- a survey

Cited in

(8)

• Hypervolume scalarization for shape optimization to improve reliability and cost of ceramic components
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• On the rectangular knapsack problem
• Approximating the product knapsack problem
• Computing representations using hypervolume scalarizations
• A lifted-space dynamic programming algorithm for the quadratic knapsack problem
• A greedy hypervolume polychotomic scheme for multiobjective combinatorial optimization
• Solving hypervolume scalarizations for MOCO problems

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem

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