Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming (Q4868799): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CPLEX / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1965651580 / rank | |||
Normal rank | |||
Revision as of 01:03, 20 March 2024
scientific article; zbMATH DE number 853119
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming |
scientific article; zbMATH DE number 853119 |
Statements
Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming (English)
0 references
1995
0 references
quadratic assignment
0 references
facility location
0 references
lower bound
0 references
interior point code
0 references
preconditioned conjugate gradient algorithm
0 references
