Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems (Q1283797): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 97 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem / rank | |||
Normal rank | |||
Latest revision as of 19:15, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems |
scientific article |
Statements
Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems (English)
0 references
17 August 1999
0 references
data-dependent bounds
0 references
Stacker-Crane problem
0 references
sequencing
0 references
minimum cost cycle
0 references
mixed graph with oriented arcs
0 references
worst-case performance
0 references
