Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming (Q4868799): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
(6 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Mauricio G. C. Resende / rank
Normal rank
 
Property / author
 
Property / author: Mauricio G. C. Resende / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QAPLIB / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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
    0 references
    0 references
    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
    0 references
    0 references

    Identifiers