Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization (Q1400780): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s000260200002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1988470180 / rank | |||
Normal rank | |||
Latest revision as of 18:36, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization |
scientific article |
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
