On the product knapsack problem

DOI10.1007/s11590-017-1227-5zbMath1404.90110OpenAlexW2782280106WikidataQ57659001 ScholiaQ57659001MaRDI QIDQ1653266

Michele Monaci, Fabio Furini, Emiliano Traversi, Claudia D'Ambrosio

Publication date: 3 August 2018

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

Full work available at URL: https://doi.org/10.1007/s11590-017-1227-5

zbMATH Keywords

complexitydynamic programmingknapsack problemmixed integer (non)linear programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items

Knapsack problems -- an overview of recent advances. I: Single knapsack problems, Approximating single- and multi-objective nonlinear sum and product knapsack problems, An exact approach for the bilevel knapsack problem with interdiction constraints and extensions, Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem, Approximating the product knapsack problem, Counting and enumerating independent sets with applications to combinatorial optimization problems, On the exact separation of cover inequalities of maximum-depth

Uses Software

• Knapsack
• ANTIGONE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristic algorithms for the general nonlinear separable knapsack problem
• The quadratic knapsack problem -- a survey
• A polyhedral branch-and-cut approach to global optimization
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• The paradox of multiple elections
• Interactions in Multiagent Systems: Fairness, Social Optimality and Individual Rationality
• Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Branching and bounds tighteningtechniques for non-convex MINLP
• Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
• An Algorithm for Large Zero-One Knapsack Problems
• Quadratic knapsack problems
• Computing Partitions with Applications to the Knapsack Problem
• Exact Solution of the Quadratic Knapsack Problem
• A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
• Discrete-Variable Extremum Problems
• A Short Introduction to Computational Social Choice