A new variant of the partitioning shortest path algorithm (Q1074506): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A branch and bound algorithm for the generalized assignment problem / rank | |||
Normal rank | |||
Latest revision as of 13:44, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new variant of the partitioning shortest path algorithm |
scientific article |
Statements
A new variant of the partitioning shortest path algorithm (English)
0 references
1986
0 references
label correcting polynomially bounded and computationally
0 references
efficient shortest path algorithm
0 references
partitioning shortest path algorithm
0 references
label correcting polynomially bounded and computationally efficient shortest path algorithm
0 references
