Visiting a network of services with time constraints. (Q1413815): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vehicle Routing with Time Windows / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Routing problems: A bibliography / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:35, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Visiting a network of services with time constraints. |
scientific article |
Statements
Visiting a network of services with time constraints. (English)
0 references
17 November 2003
0 references
Time windows
0 references
Shortest path
0 references
Routing
0 references
Scheduling
0 references
0 references