New formulations for the elementary shortest-path problem visiting a given set of nodes (Q323412)
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: New formulations for the elementary shortest-path problem visiting a given set of nodes |
scientific article; zbMATH DE number 6636500
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New formulations for the elementary shortest-path problem visiting a given set of nodes |
scientific article; zbMATH DE number 6636500 |
Statements
New formulations for the elementary shortest-path problem visiting a given set of nodes (English)
0 references
7 October 2016
0 references
combinatorial optimization
0 references
shortest-path visiting given nodes
0 references
compact extended formulation
0 references
primal-dual formulation
0 references
