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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11766-002-0051-5 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: MULKNAP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11766-002-0051-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005461483 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1007/S11766-002-0051-5 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:03, 10 December 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