A branch-and-bound algorithm for the single-row equidistant facility layout problem

DOI10.1007/s00291-010-0204-5zbMath1238.90091OpenAlexW1964361678MaRDI QIDQ421088

Gintaras Palubeckis

Publication date: 23 May 2012

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-010-0204-5

zbMATH Keywords

branch-and-bound algorithmtabu searchquadratic assignment problemfacility layout

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (9)

Construction heuristics for the single row layout problem with machine-spanning clearances ⋮ Single row layout models ⋮ Fast local search for single row facility layout ⋮ Fast simulated annealing for single-row equidistant facility layout ⋮ Decorous combinatorial lower bounds for row layout problems ⋮ The deterministic product location problem under a pick-by-order policy ⋮ Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions ⋮ Multistart search for the cyclic cutwidth minimization problem ⋮ New exact approaches to row layout problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• A survey for the quadratic assignment problem
• One-dimensional machine location problems in a multi-product flowline with equidistant locations
• Recent advances in the solution of quadratic assignment problems
• Directional decomposition heuristic for a linear machine-cell location problem.
• Lower bounds for the quadratic assignment problem via triangle decompositions
• Iterated tabu search for the maximum diversity problem
• Exact solution procedures for the balanced unidirectional cyclic layout problem
• On the exact solution of a facility layout problem
• Finding a cluster of points and the grey pattern quadratic assignment problem
• The Quadratic Assignment Problem
• Assignment Problems and the Location of Economic Activities
• On the One-Dimensional Space Allocation Problem
• Tabu Search—Part I
• Tabu Search Applied to the Quadratic Assignment Problem
• Comparison of iterative searches for the quadratic assignment problem
• The Reactive Tabu Search
• A Constructive Method for Improving Lower Bounds for a Class of Quadratic Assignment Problems
• Locating cells with bottleneck machines in cellular manufacturing systems
• An Exact Algorithm for the Quadratic Assignment Problem on a Tree
• Finite-State Processes and Dynamic Programming
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem

This page was built for publication: A branch-and-bound algorithm for the single-row equidistant facility layout problem