Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints (Q5449876): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1111/j.1475-3995.2006.00544.x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2136458540 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:46, 27 June 2024
scientific article; zbMATH DE number 5250782
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints |
scientific article; zbMATH DE number 5250782 |
Statements
Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints (English)
0 references
19 March 2008
0 references
dial-a-ride
0 references
capacity constraints
0 references
elderly transportation
0 references
