On Solving A One-Dimensional Space Allocation Problem With Integer Programming
From MaRDI portal
Publication:4095865
DOI10.1080/03155986.1976.11731633zbMath0329.68038OpenAlexW2399602646MaRDI QIDQ4095865
Publication date: 1976
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.1976.11731633
Related Items
Flow distance reduction for a multi-product flowline with sets of identical machines ⋮ Beating the SDP bound for the floor layout problem: a simple combinatorial idea ⋮ Construction heuristics for the single row layout problem with machine-spanning clearances ⋮ An ant algorithm for the single row layout problem in flexible manufacturing systems ⋮ Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem ⋮ A survey for the quadratic assignment problem ⋮ Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm ⋮ Insertion based Lin-Kernighan heuristic for single row facility layout ⋮ A computational study and survey of methods for the single-row facility layout problem ⋮ A polyhedral study of triplet formulation for single row facility layout problem ⋮ A polyhedral approach to the single row facility layout problem ⋮ A heuristic procedure for the single-row facility layout problem ⋮ Optimization of location of interconnected facilities on parallel lines with forbidden zones ⋮ Optimal solutions for the double row layout problem ⋮ The single row facility layout problem: state of the art ⋮ Methods for the one-dimensional space allocation problem ⋮ An efficient genetic algorithm for single row facility layout ⋮ The Constrained Single-Row Facility Layout Problem with Repairing Mechanisms ⋮ A GRASP algorithm for solving large-scale single row facility layout problems ⋮ Recent models and techniques for solving the layout problem ⋮ Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions ⋮ Single row facility layout problem using a permutation-based genetic algorithm ⋮ An efficient tabu algorithm for the single row facility layout problem ⋮ On the exact solution of a facility layout problem ⋮ Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts ⋮ Global Approaches for Facility Layout and VLSI Floorplanning ⋮ A new lower bound for the single row facility layout problem ⋮ New exact approaches to row layout problems ⋮ One-dimensional machine location problems in a multi-product flowline with equidistant locations ⋮ A semidefinite optimization approach for the single-row layout problem with unequal dimensions ⋮ Efficient models for the facility layout problem
