The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width (Q3612424)
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 5527163
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width |
scientific article; zbMATH DE number 5527163 |
Statements
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width (English)
0 references
10 March 2009
0 references
constraint programming
0 references
integer programming
0 references
polyhedral combinatorics
0 references
cutting planes
0 references
0.8449862599372864
0 references
0.7607631087303162
0 references
0.7585944533348083
0 references
0.7560058832168579
0 references
