Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems (Q4120313): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An Algorithm for Separable Nonconvex Programming Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints / rank | |||
Normal rank | |||
Latest revision as of 19:48, 12 June 2024
scientific article; zbMATH DE number 3545363
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems |
scientific article; zbMATH DE number 3545363 |
Statements
Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems (English)
0 references
1976
0 references
