A polyhedral study of the elementary shortest path problem with resource constraints (Q1691657)
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 polyhedral study of the elementary shortest path problem with resource constraints |
scientific article; zbMATH DE number 6829428
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polyhedral study of the elementary shortest path problem with resource constraints |
scientific article; zbMATH DE number 6829428 |
Statements
A polyhedral study of the elementary shortest path problem with resource constraints (English)
0 references
25 January 2018
0 references
elementary shortest path with resource constraints
0 references
vehicle routing problem with time windows
0 references
integer programming
0 references
polyhedral study
0 references
