A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems (Q3923953): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:45, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems |
scientific article |
Statements
A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems (English)
0 references
1981
0 references
non-separable non-convex programming
0 references
branch and bound method
0 references
simplicial subdivision
0 references
hypercube
0 references
