Semidefinite relaxation of kanpsack problem

Semidefinite relaxation of kanpsack problem

0.00 Avg rating0 Votes
Article ID: iaor20041793
Country: China
Volume: 17A
Issue: 4
Start Page Number: 460
End Page Number: 470
Publication Date: Jan 2002
Journal: Applied Mathematics (A Journal of Chinese Universities)
Authors: ,
Keywords: knapsack problem
Abstract:

Knapsack is a classical NP-hard problem. In the last ten years, semi-definite relaxation technique has been successfully employed to solve some combinatorial optimization problems. The paper presents the rank one semi-definite relaxation programming (SKSSA) of the knapsack problem. Based on this, a randomized approximation algorithm KSSD to solve a knapsack problem is constructed.

Reviews

Required fields are marked *. Your email address will not be published.