Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles (Q2017836)
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: Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles |
scientific article; zbMATH DE number 6418515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles |
scientific article; zbMATH DE number 6418515 |
Statements
Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles (English)
0 references
23 March 2015
0 references
polytope
0 references
digraphs
0 references
shortest path
0 references
valid inequality
0 references
lifting
0 references
0 references
0.8194842338562012
0 references
0.8189300894737244
0 references
0.7797912359237671
0 references
0.7760358452796936
0 references
0.7738065123558044
0 references
