An <i>n‐step</i>, 2‐variable search algorithm for the component placement problem (Q4401227): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/nav.3800200409 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/nav.3800200409 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997420803 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NAV.3800200409 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:55, 29 December 2024
scientific article; zbMATH DE number 3433640
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An <i>n‐step</i>, 2‐variable search algorithm for the component placement problem |
scientific article; zbMATH DE number 3433640 |
Statements
An <i>n‐step</i>, 2‐variable search algorithm for the component placement problem (English)
0 references
1973
0 references
