Solution Approaches for the Double-Row Equidistant Facility Layout Problem

DOI10.1007/978-3-319-28697-6_3zbMath1342.90086OpenAlexW2461328301MaRDI QIDQ2806884

Philipp Hungerländer, Miguel F. Anjos, Anja Fischer

Publication date: 19 May 2016

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28697-6_3

Mathematics Subject Classification ID

Semidefinite programming (90C22) Mixed integer programming (90C11) Linear programming (90C05) Discrete location and assignment (90B80)

Related Items (4)

Improved exact approaches for row layout problems with departments of equal length ⋮ Decorous combinatorial lower bounds for row layout problems ⋮ A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem ⋮ A decomposition-based algorithm for the double row layout problem

Uses Software

• Gurobi

Cites Work

• A computational study and survey of methods for the single-row facility layout problem
• A new lower bound for the single row facility layout problem
• A Spectral Bundle Method for Semidefinite Programming

This page was built for publication: Solution Approaches for the Double-Row Equidistant Facility Layout Problem