No label defined (Q3686501)
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 3908168
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3908168 |
Statements
1985
0 references
computational complexity
0 references
branch and bound
0 references
semicontinuous variables
0 references
0.8336436748504639
0 references
0.8280757665634155
0 references
[For the entire collection see Zbl 0566.00033.] Following an introduction, which discusses the motivation for studying integer programming, the relevance of computational complexity and the relative merits of integer and dynamic programming, the branch and bound method is introduced in general terms. Various types of global entity to which it can be applied are introduced. These are integer variables, semicontinuous variables, special ordered sets and chains of linked ordered sets. A discussion of the algorithmic details follows. Finally, various approaches to automatic model reformulation are discussed: this seems to be the most important current area of integer programming research.
0 references