A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations (Q1908292): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02098280 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2076862344 / rank | |||
Normal rank | |||
Latest revision as of 09:49, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations |
scientific article |
Statements
A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations (English)
0 references
18 March 1996
0 references
Lagrangian relaxation
0 references
shortest path relaxation
0 references
vehicle routing
0 references
0 references
