Approximating the maximum quadratic assignment problem (Q1607075): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Capacitated Routing and Delivery Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dense \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of bounded approximation algorithms for graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for minimum tree partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for min-sum \(p\)-clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for maximum packing of 3-edge paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better approximations for max TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for maximum dispersion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem with Distances One and Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and Special Case Algorithms for Dispersion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obnoxious Facility Location on Graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(00)00151-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023485317 / rank
 
Normal rank

Latest revision as of 08:49, 30 July 2024

scientific article
Language Label Description Also known as
English
Approximating the maximum quadratic assignment problem
scientific article

    Statements

    Approximating the maximum quadratic assignment problem (English)
    0 references
    0 references
    0 references
    0 references
    25 July 2002
    0 references

    Identifiers