Computing directed Steiner path covers (Q2125222): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Egon Wanke / rank | |||
| Property / author | |||
| Property / author: Egon Wanke / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3186352619 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 2012.12232 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:06, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing directed Steiner path covers |
scientific article |
Statements
Computing directed Steiner path covers (English)
0 references
13 April 2022
0 references
binary integer program
0 references
combinatorial optimization
0 references
directed co-graphs
0 references
directed Steiner path cover problem
0 references
directed Steiner path problem
0 references
directed Hamiltonian path problem
0 references
pick-and-place machines
0 references
