Improved exact approaches for row layout problems with departments of equal length
type: Item
instance of: scholarly article
title: Improved exact approaches for row layout problems with departments of equal length
zbMATH Open document ID: 1403.90466
author: Miguel F. Anjos
author: Anja Fischer
author: Philipp Hungerländer
published in: European Journal of Operational Research
publication date: 2018-07-12T00:00:00Z
full work available at URL: Improved Exact Approaches for Row Layout Problems with Departments of Equal Length.pdf
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6902951
zbMATH Keywords: facilities planning and design
zbMATH Keywords: facility layout
zbMATH Keywords: mixed integer linear programming
zbMATH Keywords: semidefinite programming
zbMATH Keywords: computational experiments
describes a project that uses: RowLayout
describes a project that uses: CPLEX
describes a project that uses: ConicBundle
MaRDI profile type: Publication
OpenAlex ID: W2797484368
cites work: Single Machine Job Sequencing with Precedence Constraints
cites work: A new lower bound for the single row facility layout problem
cites work: The corridor allocation problem
cites work: Optimal solutions for the double row layout problem
cites work: A parallel ordering problem in facilities layout
cites work: Solution Approaches for the Double-Row Equidistant Facility Layout Problem
cites work: A semidefinite optimization approach for the single-row layout problem with unequal dimensions
cites work: Handbook on semidefinite, conic and polynomial optimization
cites work: Introduction to Semidefinite, Conic and Polynomial Optimization
cites work: Global Approaches for Facility Layout and VLSI Floorplanning
cites work: Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
cites work: LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
cites work: On the cut polytope
cites work: Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
cites work: Assignment Problems
cites work: Optimal linear arrangements using betweenness variables
cites work: Decorous lower bounds for minimum linear arrangement
cites work: The double row layout problem
cites work: Geometry of cuts and metrics
cites work: Hospital Layout as a Quadratic Assignment Problem
cites work: A New Exact Approach to the Space-Free Double Row Layout Problem
cites work: Some simplified NP-complete graph problems
cites work: Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
cites work: Optimal Assignments of Numbers to Vertices
cites work: Optimal numberings and isoperimetric problems on graphs
cites work: Q5465120
cites work: A Spectral Bundle Method for Semidefinite Programming
cites work: Efficient models for the facility layout problem
cites work: A semidefinite optimization-based approach for global optimization of multi-row facility layout
cites work: A computational study and survey of methods for the single-row facility layout problem
cites work: Mapping the genome
cites work: Single row layout models
cites work: Q4414506
cites work: The single row facility layout problem: state of the art
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: A survey for the quadratic assignment problem
cites work: Optimal Numberings of an $N \times N$ Array
cites work: Q4036610
cites work: A new heuristic for the linear placement problem
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications
Wikidata QID: Q129983334
DOI: 10.1016/J.EJOR.2018.04.008
description: scientific article; zbMATH DE number 6902951