On reduction of duality gap in quadratic knapsack problems
From MaRDI portal
Publication:693132
DOI10.1007/s10898-012-9872-9zbMath1281.90045WikidataQ57445437 ScholiaQ57445437MaRDI QIDQ693132
Xiaoling Sun, Xiao Jin Zheng, Li, Duan, Yi-Fan Xu
Publication date: 7 December 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9872-9
90C46: Optimality conditions and duality in mathematical programming
90C27: Combinatorial optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- The quadratic knapsack problem -- a survey
- On the stability of a dual weak vector variational inequality problem
- Global extremal conditions for multi-integer quadratic programming
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
- Lagrangean methods for the 0-1 quadratic knapsack problem
- A semidefinite programming approach to the quadratic knapsack problem
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- A new upper bound for the 0-1 quadratic knapsack problem
- On the supermodular knapsack problem
- Reverse search for enumeration
- Quadratic knapsack problems
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
- Exact Solution of the Quadratic Knapsack Problem
- A polynomial case of unconstrained zero-one quadratic optimization
