Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem (Q743645)
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: Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem |
scientific article; zbMATH DE number 6349869
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem |
scientific article; zbMATH DE number 6349869 |
Statements
Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem (English)
0 references
30 September 2014
0 references
transportation scheduling
0 references
multicommodity flow
0 references
branch-and-cut algorithm
0 references
0 references
0.897652268409729
0 references
0.7855840921401978
0 references
0.7701476216316223
0 references
0.7679758667945862
0 references
