Semi-definite relaxation algorithm of multiple knapsack problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1261818 (Why is no real title available?)
- scientific article; zbMATH DE number 1302192 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1182772 (Why is no real title available?)
- An algorithm for 0-1 multiple-knapsack problems
- An exact algorithm for large multiple knapsack problems
- Approximating quadratic programming with bound and quadratic constraints
- Geometric algorithms and combinatorial 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
- Semidefinite Programming
- Semidefinite programming and combinatorial optimization
- Semidefinite programming in combinatorial optimization
- Semidefinite relaxation and nonconvex quadratic optimization
- Solution of the zero-one multiple knapsack problem
Cited in
(2)
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)