Global optimality conditions and optimization methods for quadratic knapsack problems

DOI10.1007/S10957-011-9885-4MaRDI QIDQ658556zbMATH OpenOpenAlexWikidataFDO

Authors Juan-Miguel Gracia

Publication date 12 January 2012

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10957-011-9885-4

zbMATH Keywords

global optimality conditionsquadratic knapsack problemglobal optimization methodlocal optimization method

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Recommendations

• Exact solution methods for the \(k\)-item quadratic knapsack problem
• Algorithms for the solution of quadratic knapsack problems
• Exact Solution of the Quadratic Knapsack Problem
• Integer quadratic knapsack problems
• Global optimality conditions and optimization methods for quadratic assignment problems

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1302173 (Why is no real title available?)
• A Selection Problem of Shared Fixed Costs and Network Flows
• A new upper bound for the 0-1 quadratic knapsack problem
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
• Exact Solution of the Quadratic Knapsack Problem
• Global optimality conditions for quadratic optimization problems with binary constraints
• Handbook of test problems in local and global optimization
• Lagrangean methods for the 0-1 quadratic knapsack problem
• Linear programming for the \(0-1\) quadratic knapsack problem
• Min-cut clustering
• On the supermodular knapsack problem
• Quadratic knapsack problems
• Sufficient global optimality conditions for bivalent quadratic optimization
• Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
• The quadratic 0-1 knapsack problem with series-parallel support
• The quadratic knapsack problem -- a survey

Cited in

(2)

• A note on optimal solutions to quadratic knapsack problems
• Global optimality conditions and optimization methods for quadratic assignment problems

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: Global optimality conditions and optimization methods for quadratic knapsack problems

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