A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00291-010-0204-5 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C57 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6038013 / rank
 
Normal rank
Property / zbMATH Keywords
 
facility layout
Property / zbMATH Keywords: facility layout / rank
 
Normal rank
Property / zbMATH Keywords
 
quadratic assignment problem
Property / zbMATH Keywords: quadratic assignment problem / rank
 
Normal rank
Property / zbMATH Keywords
 
branch-and-bound algorithm
Property / zbMATH Keywords: branch-and-bound algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
tabu search
Property / zbMATH Keywords: tabu search / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00291-010-0204-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964361678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exact solution of a facility layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in the solution of quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Reactive Tabu Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A thermodynamically motivated simulation procedure for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constructive Method for Improving Lower Bounds for a Class of Quadratic Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Quadratic Assignment Problem on a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a cluster of points and the grey pattern 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: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the quadratic assignment problem via triangle decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-State Processes and Dynamic Programming / 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: A survey for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution procedures for the balanced unidirectional cyclic layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated tabu search for the maximum diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the One-Dimensional Space Allocation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-dimensional machine location problems in a multi-product flowline with equidistant locations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search Applied to the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of iterative searches for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating cells with bottleneck machines in cellular manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directional decomposition heuristic for a linear machine-cell location problem. / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00291-010-0204-5 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:04, 9 December 2024

scientific article
Language Label Description Also known as
English
A branch-and-bound algorithm for the single-row equidistant facility layout problem
scientific article

    Statements

    A branch-and-bound algorithm for the single-row equidistant facility layout problem (English)
    0 references
    0 references
    23 May 2012
    0 references
    facility layout
    0 references
    quadratic assignment problem
    0 references
    branch-and-bound algorithm
    0 references
    tabu search
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers