A note on the separation of subtour elimination constraints in elementary shortest path problems (Q2355890)
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: A note on the separation of subtour elimination constraints in elementary shortest path problems |
scientific article; zbMATH DE number 6466410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the separation of subtour elimination constraints in elementary shortest path problems |
scientific article; zbMATH DE number 6466410 |
Statements
A note on the separation of subtour elimination constraints in elementary shortest path problems (English)
0 references
28 July 2015
0 references
integer programming
0 references
branch-and-cut
0 references
separation
0 references
subtour elimination constraints
0 references
strong components
0 references
0 references
0.754535973072052
0 references
0.7491739392280579
0 references
0.7465991377830505
0 references
0.7427017092704773
0 references
0.7426035404205322
0 references
