Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: CPLEX / rank | |||
Normal rank |
Revision as of 14:09, 28 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lagrangean decompositions for the unconstrained binary quadratic programming problem |
scientific article |
Statements
Lagrangean decompositions for the unconstrained binary quadratic programming problem (English)
0 references
17 August 2011
0 references
quadratic programming
0 references
Lagrangian decomposition
0 references
bounds
0 references