A quadratic assignment problem without column constraints (Q5580104): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
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.3800160312 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1558105038 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling to Minimize Interaction Cost / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:01, 12 June 2024
scientific article; zbMATH DE number 3296948
Language | Label | Description | Also known as |
---|---|---|---|
English | A quadratic assignment problem without column constraints |
scientific article; zbMATH DE number 3296948 |
Statements
A quadratic assignment problem without column constraints (English)
0 references
1969
0 references
operations research
0 references