A branch-and-bound algorithm for the linear ordering problem with cumulative costs (Q2426525): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:08, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for the linear ordering problem with cumulative costs |
scientific article |
Statements
A branch-and-bound algorithm for the linear ordering problem with cumulative costs (English)
0 references
22 April 2008
0 references
branch-and-bound
0 references
combinatorial optimization
0 references
linear ordering problem
0 references
