Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 429061
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems |
scientific article; zbMATH DE number 429061 |
Statements
Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (English)
0 references
13 October 1993
0 references
decomposition
0 references
convex-concave function
0 references
branch-and-bound
0 references
cutting plane
0 references
global minimization
0 references
relaxation bounding
0 references
adaptive branching
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8005040287971497
0 references
0.7991436123847961
0 references
0.7986716032028198
0 references
0.7917191386222839
0 references
