Global optimality conditions and optimization methods for quadratic knapsack problems

DOI10.1007/s10957-011-9885-4zbMath1237.90214OpenAlexW1973286416WikidataQ56050296 ScholiaQ56050296MaRDI QIDQ658556

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

quadratic knapsack problemglobal optimality conditionsglobal optimization methodlocal optimization method

Mathematics Subject Classification ID

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

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Sufficient global optimality conditions for bivalent quadratic optimization
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• The quadratic knapsack problem -- a survey
• Linear programming for the \(0-1\) quadratic knapsack problem
• Lagrangean methods for the 0-1 quadratic knapsack problem
• Handbook of test problems in local and global optimization
• Min-cut clustering
• A new upper bound for the 0-1 quadratic knapsack problem
• On the supermodular knapsack problem
• The quadratic 0-1 knapsack problem with series-parallel support
• Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
• Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
• Quadratic knapsack problems
• Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
• Exact Solution of the Quadratic Knapsack Problem
• A Selection Problem of Shared Fixed Costs and Network Flows

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