Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1007/s10589-005-3076-x / rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S10589-005-3076-X / rank | |||
Normal rank |
Latest revision as of 02:17, 19 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solving convex MINLP optimization problems using a sequential cutting plane algorithm |
scientific article |
Statements
Solving convex MINLP optimization problems using a sequential cutting plane algorithm (English)
0 references
28 September 2006
0 references
convex programming
0 references
branch and bound
0 references
cutting plane algorithms
0 references
mixed integer nonlinear programming
0 references