A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron |
scientific article; zbMATH DE number 633601
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron |
scientific article; zbMATH DE number 633601 |
Statements
A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (English)
0 references
5 September 1994
0 references
branch and bound
0 references
cutting planes
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
