An <i>O</i>(<i>n</i><sup>4</sup>) Algorithm for the QAP Linearization Problem (Q2884300): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1287/moor.1110.0509 / rank
Normal rank
 
Property / author
 
Property / author: Q203393 / rank
Normal rank
 
Property / author
 
Property / author: Santosh N. Kabadi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/moor.1110.0509 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964265873 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/MOOR.1110.0509 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:12, 20 December 2024

scientific article
Language Label Description Also known as
English
An <i>O</i>(<i>n</i><sup>4</sup>) Algorithm for the QAP Linearization Problem
scientific article

    Statements

    An <i>O</i>(<i>n</i><sup>4</sup>) Algorithm for the QAP Linearization Problem (English)
    0 references
    0 references
    0 references
    24 May 2012
    0 references
    quadratic assignment problem
    0 references
    linearization
    0 references
    polynomial algorithms
    0 references
    solvable cases
    0 references

    Identifiers