On the complexity of the separation problem for rounded capacity inequalities (Q1751233)
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 6872139
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the separation problem for rounded capacity inequalities |
scientific article; zbMATH DE number 6872139 |
Statements
On the complexity of the separation problem for rounded capacity inequalities (English)
0 references
24 May 2018
0 references
branch-and-cut
0 references
polyhedral combinatorics
0 references
computational complexity
0 references
capacitated vehicle routing problem
0 references
0 references
0.9270994
0 references
0.8801864
0 references
0.87330806
0 references
0.8687272
0 references
0.86586106
0 references
0.85910493
0 references
0.8586538
0 references
0.8537648
0 references
0.8482865
0 references
