Efficient feasibility testing for dial-a-ride problems (Q1866982): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: k-interchange procedures for local search in a precedence-constrained routing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling Large-Scale Advance-Request Dial-A-Ride Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing / rank | |||
Normal rank | |||
Revision as of 13:27, 5 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient feasibility testing for dial-a-ride problems |
scientific article |
Statements
Efficient feasibility testing for dial-a-ride problems (English)
0 references
2 April 2003
0 references
0 references
0 references
