Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows (Q3093046): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58921369, #quickstatements; #temporary_batch_1711094041063 |
Created claim: DBLP publication ID (P1635): journals/oms/GuerrieroP11, #quickstatements; #temporary_batch_1731468600454 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/oms/GuerrieroP11 / rank | |||
Normal rank | |||
Latest revision as of 05:07, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows |
scientific article |
Statements
Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows (English)
0 references
12 October 2011
0 references
shortest path problem
0 references
time window constraints
0 references
bi-criteria network
0 references
fractional objective function
0 references
multiple labelling approaches
0 references
