Semi-definite relaxation algorithm of multiple knapsack problem

DOI10.1007/s11766-002-0051-5zbMath1006.90070OpenAlexW2005461483MaRDI QIDQ698390

Enyu Yao, Feng Chen

Publication date: 18 September 2002

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-002-0051-5

zbMATH Keywords

knapsack problemsemi-definite programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Combinatorial optimization (90C27)

Uses Software

• Knapsack
• MULKNAP

Cites Work

• Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
• An exact algorithm for large multiple knapsack problems
• Solution of the zero-one multiple knapsack problem
• Geometric algorithms and combinatorial optimization
• Semidefinite programming in combinatorial optimization
• Approximating quadratic programming with bound and quadratic constraints
• An algorithm for 0-1 multiple-knapsack problems
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Semidefinite relaxation and nonconvex quadratic optimization
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Semidefinite Programming
• Semidefinite programming and combinatorial optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Semi-definite relaxation algorithm of multiple knapsack problem