Global optimality conditions and optimization methods for quadratic knapsack problems
DOI10.1007/S10957-011-9885-4zbMATH Open1237.90214OpenAlexW1973286416WikidataQ56050296 ScholiaQ56050296MaRDI QIDQ658556FDOQ658556
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
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
global optimality conditionsquadratic knapsack problemglobal optimization methodlocal optimization method
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- The quadratic knapsack problem -- a survey
- Title not available (Why is that?)
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- Global optimality conditions for quadratic optimization problems with binary constraints
- Sufficient global optimality conditions for bivalent quadratic optimization
- Quadratic knapsack problems
- Handbook of test problems in local and global optimization
- Min-cut clustering
- The quadratic 0-1 knapsack problem with series-parallel support
- Exact Solution of the Quadratic Knapsack Problem
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Linear programming for the \(0-1\) quadratic knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- A Selection Problem of Shared Fixed Costs and Network Flows
- A new upper bound for the 0-1 quadratic knapsack problem
- On the supermodular knapsack problem
- Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
Cited In (2)
Uses Software
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)
