\( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem (Q2026989): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2020.105125 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2020.105125 / rank | |||
Normal rank | |||
Latest revision as of 19:47, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem |
scientific article |
Statements
\( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem (English)
0 references
21 May 2021
0 references
decision diagrams
0 references
\( \mathrm{A}^*\) search
0 references
scheduling
0 references
sequencing
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
