An ordering (enumerative) algorithm for nonlinear \(0-1\) programming (Q1338536)
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: An ordering (enumerative) algorithm for nonlinear \(0-1\) programming |
scientific article; zbMATH DE number 698696
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An ordering (enumerative) algorithm for nonlinear \(0-1\) programming |
scientific article; zbMATH DE number 698696 |
Statements
An ordering (enumerative) algorithm for nonlinear \(0-1\) programming (English)
0 references
1 December 1994
0 references
An algorithm to solve a general 0-1 programming problem with nonlinear objective function is developed and computational experiences are given. The original problem is reduced to a sequence of special set packing problems being equivalent to the problem of ordering binary vectors according to their objective function value.
0 references
set packing problems
0 references
0 references
