A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems (Q3923953): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0304-0208(08)73476-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W110184996 / rank | |||
Normal rank | |||
Latest revision as of 08:32, 30 July 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
