A branch and bound algorithm for solving separable convex integer programming problems (Q1342308)
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 branch and bound algorithm for solving separable convex integer programming problems |
scientific article; zbMATH DE number 710289
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for solving separable convex integer programming problems |
scientific article; zbMATH DE number 710289 |
Statements
A branch and bound algorithm for solving separable convex integer programming problems (English)
0 references
27 June 1995
0 references
branch-and-bound
0 references
nonlinear integer programming
0 references
separable convex objective function
0 references
fathoming
0 references
partitioning
0 references
reoptimizing schemes
0 references
0 references
0 references
0 references
0 references
0 references
