A modified version of Tuy's method for solving d.c. programing problem (Q3813618)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A modified version of Tuy's method for solving d.c. programing problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A modified version of Tuy's method for solving d.c. programing problem |
scientific article |
Statements
A modified version of Tuy's method for solving d.c. programing problem (English)
0 references
1988
0 references
canonical forms
0 references
cutting method
0 references
algorithm
0 references
d.c. programming
0 references
implementation
0 references
0.87698764
0 references
0.84162605
0 references
0.8401486
0 references
0.8342589
0 references
0.82597125
0 references
0.8194994
0 references
0.81531405
0 references
0.8142319
0 references
0.81397754
0 references
