A combinatorial auction for transportation matching service: formulation and adaptive large neighborhood search heuristic (Q1691664)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A combinatorial auction for transportation matching service: formulation and adaptive large neighborhood search heuristic |
scientific article; zbMATH DE number 6829431
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A combinatorial auction for transportation matching service: formulation and adaptive large neighborhood search heuristic |
scientific article; zbMATH DE number 6829431 |
Statements
A combinatorial auction for transportation matching service: formulation and adaptive large neighborhood search heuristic (English)
0 references
25 January 2018
0 references
pickup-and-delivery problem with jobs dependency
0 references
winner determination problem
0 references
logistics
0 references
0.86621696
0 references
0 references
0.86168253
0 references
0.8600842
0 references
0.8599314
0 references
0.85769415
0 references
0.8528051
0 references
0.85135794
0 references
0.8472594
0 references
