On disjunctive cuts for combinatorial optimization (Q5952319)
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 1688724
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On disjunctive cuts for combinatorial optimization |
scientific article; zbMATH DE number 1688724 |
Statements
On disjunctive cuts for combinatorial optimization (English)
0 references
2001
0 references
integer programming
0 references
cutting planes
0 references
max-cut problem
0 references
asymmetric travelling salesman problem
0 references
set covering problem
0 references
0.8402810096740723
0 references
0.8296922445297241
0 references
0.821152925491333
0 references
0.8036867380142212
0 references
