Improved exact approaches for row layout problems with departments of equal length

DOI10.1016/j.ejor.2018.04.008zbMath1403.90466OpenAlexW2797484368WikidataQ129983334 ScholiaQ129983334MaRDI QIDQ1651703

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

Publication date: 12 July 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/85925183/Improved_Exact_Approaches_for_Row_Layout_Problems_with_Departments_of_Equal_Length.pdf

zbMATH Keywords

semidefinite programmingcomputational experimentsmixed integer linear programmingfacility layoutfacilities planning and design

Mathematics Subject Classification ID

Semidefinite programming (90C22) Mixed integer programming (90C11) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (4)

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 ⋮ New exact approaches to row layout problems ⋮ Exact approaches for the combined cell layout problem

Uses Software

• CPLEX
• ConicBundle
• RowLayout

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A semidefinite optimization-based approach for global optimization of multi-row facility layout
• Single row layout models
• A parallel ordering problem in facilities layout
• The corridor allocation problem
• A computational study and survey of methods for the single-row facility layout problem
• Handbook on semidefinite, conic and polynomial optimization
• Efficient models for the facility layout problem
• A survey for the quadratic assignment problem
• A new lower bound for the single row facility layout problem
• Some simplified NP-complete graph problems
• Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
• Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
• Optimal linear arrangements using betweenness variables
• Optimal solutions for the double row layout problem
• The single row facility layout problem: state of the art
• A new heuristic for the linear placement problem
• LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions
• Introduction to Semidefinite, Conic and Polynomial Optimization
• Global Approaches for Facility Layout and VLSI Floorplanning
• Solution Approaches for the Double-Row Equidistant Facility Layout Problem
• Decorous Lower Bounds for Minimum Linear Arrangement
• The double row layout problem
• Assignment Problems
• Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
• Single Machine Job Sequencing with Precedence Constraints
• Hospital Layout as a Quadratic Assignment Problem
• A Spectral Bundle Method for Semidefinite Programming
• A New Exact Approach to the Space-Free Double Row Layout Problem
• On the cut polytope
• Optimal Numberings of an $N \times N$ Array
• Mapping the genome
• Computer Solutions of the Traveling Salesman Problem
• Optimal numberings and isoperimetric problems on graphs
• Optimal Assignments of Numbers to Vertices
• Geometry of cuts and metrics
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: Improved exact approaches for row layout problems with departments of equal length