Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230): 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:50, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph |
scientific article |
Statements
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (English)
0 references
13 April 2022
0 references
path cover
0 references
flow-shop scheduling
0 references
conflict graph
0 references
\(b\)-matching
0 references
approximation algorithm
0 references
