On Solving A One-Dimensional Space Allocation Problem With Integer Programming

DOI10.1080/03155986.1976.11731633MaRDI QIDQ4095865zbMATH OpenOpenAlexFDO

Authors Robert F. Love, Jsun Y. Wong

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Integer programming (90C10)

Cited in

(33)

• A new lower bound for the single row facility layout problem
• Recent models and techniques for solving the layout problem
• One-dimensional machine location problems in a multi-product flowline with equidistant locations
• A heuristic procedure for the single-row facility layout problem
• A GRASP algorithm for solving large-scale single row facility layout problems
• Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
• Flow distance reduction for a multi-product flowline with sets of identical machines
• An ant algorithm for the single row layout problem in flexible manufacturing systems
• Optimal solutions for the double row layout problem
• The single row facility layout problem: state of the art
• An efficient tabu algorithm for the single row facility layout problem
• New exact approaches to row layout problems
• An efficient genetic algorithm for single row facility layout
• On the exact solution of a facility layout problem
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions
• Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
• Global approaches for facility layout and VLSI floorplanning
• Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
• The constrained single-row facility layout problem with repairing mechanisms
• 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 approach to the single row facility layout problem
• Optimization of location of interconnected facilities on parallel lines with forbidden zones
• Single row facility layout problem using a permutation-based genetic algorithm
• 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
• A polyhedral study of triplet formulation for single row facility layout problem
• Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem
• A matheuristic for solving the single row facility layout problem
• Efficient models for the facility layout problem
• A survey for the quadratic assignment problem
• Methods for the one-dimensional space allocation problem

This page was built for publication: On Solving A One-Dimensional Space Allocation Problem With Integer Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4095865)