Semi-definite relaxation algorithm of multiple knapsack problem

DOI10.1007/S11766-002-0051-5zbMATH Open1006.90070OpenAlexW2005461483MaRDI QIDQ698390FDOQ698390

Authors: Feng Chen, Enyu Yao 

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

Recommendations

• scientific article; zbMATH DE number 1911487
• Publication:4941826
• A semidefinite programming approach to the quadratic knapsack problem
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• Publication:4952619

zbMATH Keywords

knapsack problemsemi-definite programming

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Relaxations and heuristics for the multiple non-linear separable knapsack problem
• Title not available (Why is that?)

Uses Software

• Knapsack
• MULKNAP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698390)