A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (Q1296800): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Peter M. Hahn / rank
Normal rank
 
Property / author
 
Property / author: Peter M. Hahn / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QAPLIB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lower bounds for a class of quadratic 0,1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound-based heuristic for solving the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for quadratic Boolean programs with applications to quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: QAPLIB-A quadratic assignment problem library / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Lower Bound for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hospital Layout as a Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5524189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems and the Location of Economic Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Assignment and Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel branch and bound algorithm for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:27, 28 May 2024

scientific article
Language Label Description Also known as
English
A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
scientific article

    Statements

    A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (English)
    0 references
    0 references
    0 references
    0 references
    3 August 1999
    0 references
    quadratic assignment problem
    0 references
    branch-and-bound
    0 references
    quadratic programming
    0 references
    integer programming
    0 references

    Identifiers