Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience (Q613323): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.orl.2010.07.008 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ORL.2010.07.008 / rank | |||
Normal rank | |||
Latest revision as of 22:17, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience |
scientific article |
Statements
Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience (English)
0 references
20 December 2010
0 references
d.c. programmings
0 references
nonconvex programming
0 references
branch and bound
0 references
0 references
0 references
0 references
0 references
