A polyhedral approach to the single row facility layout problem
type: Item
instance of: scholarly article
title: A polyhedral approach to the single row facility layout problem
zbMATH Open document ID: 1280.90132
author: André R. S. Amaral
author: Adam N. Letchford
published in: Mathematical Programming. Series A. Series B
publication date: 2013-11-11T00:00:00Z
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6225206
zbMATH Keywords: facility layout
zbMATH Keywords: polyhedral combinatorics
zbMATH Keywords: branch-and-cut
MaRDI profile type: Publication
full work available at URL: s10107-012-0533-z
OpenAlex ID: W1982846944
Wikidata QID: Q57702149
cites work: On the exact solution of a facility layout problem
cites work: An Exact Approach to the One-Dimensional Facility Layout Problem
cites work: A new lower bound for the single row facility layout problem
cites work: A semidefinite optimization approach for the single-row layout problem with unequal dimensions
cites work: Global Approaches for Facility Layout and VLSI Floorplanning
cites work: Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
cites work: Provably near-optimal solutions for very large single-row facility layout problems
cites work: Stronger linear programming relaxations of max-cut
cites work: Decorous lower bounds for minimum linear arrangement
cites work: A branch and bound algorithm for maximum likelihood paired comparison ranking
cites work: Polyhedral Approaches to Mixed Integer Linear Programming
cites work: Fifty-Plus Years of Combinatorial Integer Programming
cites work: Single row facility layout problem using a permutation-based genetic algorithm
cites work: Geometry of cuts and metrics
cites work: Some simplified NP-complete graph problems
cites work: Geometric algorithms and combinatorial optimization
cites work: Efficient models for the facility layout problem
cites work: A computational study and survey of methods for the single-row facility layout problem
cites work: Finite-State Processes and Dynamic Programming
cites work: On the Facial Structure of the Set of Correlation Matrices
cites work: Generating lower bounds for the linear arrangement problem
cites work: On Solving A One-Dimensional Space Allocation Problem With Integer Programming
cites work: On the One-Dimensional Space Allocation Problem
cites work: Minimum cuts and related problems
cites work: One-Dimensional Space Allocation: An Ordering Algorithm
cites work: An ant algorithm for the single row layout problem in flexible manufacturing systems
cites work: Multidimensional scaling. I: Theory and method
DOI: 10.1007/S10107-012-0533-Z
description: scientific article; zbMATH DE number 6225206