Future paths for integer programming and links to artificial intelligence (Q1821034)
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 3997561
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Future paths for integer programming and links to artificial intelligence |
scientific article; zbMATH DE number 3997561 |
Statements
Future paths for integer programming and links to artificial intelligence (English)
0 references
1986
0 references
Integer programming has benefited from many innovations in models and methods. Some of the promising directions for elaborating these innovations in the future may be viewed from a framework that links the perspectives of artificial intelligence and operations research. To demonstrate this, four key areas are examined: (1) controlled randomization, (2) learning strategies, (3) induced decomposition and (4) tabu search. Each of these is shown to have characteristics that appear usefully relevant to developments on the horizon.
0 references
artificial intelligence
0 references
controlled randomization
0 references
learning strategies
0 references
induced decomposition
0 references
tabu search
0 references
0 references
0 references
0 references
0.8687095
0 references
0.8627807
0 references
0.85737497
0 references
0.85118604
0 references
0.8506798
0 references
0.8494487
0 references
0 references
