Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization (Q1400780)
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: Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization |
scientific article; zbMATH DE number 1964603
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization |
scientific article; zbMATH DE number 1964603 |
Statements
Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization (English)
0 references
14 August 2003
0 references
optimization
0 references
discrete optimization
0 references
divide and qonquer
0 references
dynamic programming
0 references
dynamic-programming schemes
0 references
algorithmic complexity
0 references
computational complexity
0 references
embedding complexity
0 references
treewidth
0 references
LP
0 references
linear programming
0 references
ILP
0 references
integer linear programming
0 references
Boltzmann statistics for discrete optimization problems
0 references
0.8423393964767456
0 references
0.7012137770652771
0 references
