Semi-definite relaxation algorithm of multiple knapsack problem (Q698390): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxation and nonconvex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating quadratic programming with bound and quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for 0-1 multiple-knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the zero-one multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for large multiple knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming and combinatorial optimization / rank
 
Normal rank

Revision as of 16:24, 4 June 2024

scientific article
Language Label Description Also known as
English
Semi-definite relaxation algorithm of multiple knapsack problem
scientific article

    Statements

    Semi-definite relaxation algorithm of multiple knapsack problem (English)
    0 references
    0 references
    0 references
    18 September 2002
    0 references
    knapsack problem
    0 references
    semi-definite programming
    0 references
    0 references
    0 references

    Identifiers