A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands (Q1730662): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10479-017-2500-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2607618241 / rank | |||
Normal rank | |||
Revision as of 19:15, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands |
scientific article |
Statements
A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands (English)
0 references
6 March 2019
0 references
transportation
0 references
routing problems
0 references
city logistics
0 references
exact algorithms
0 references
