Integer programming approaches to facilities layout models with forbidden areas

DOI10.1023/A:1018925728178MaRDI QIDQ1265901zbMATH OpenFDO

Authors Les R. Foulds, Horst W. Hamacher, John M. Wilson

Publication date 27 September 1998

Published in Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

integer programmingfacilities layoutforbidden area

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• Enhanced Model Formulations for Optimal Facility Layout
• Optimal facility layout design
• Efficient models for the facility layout problem
• scientific article; zbMATH DE number 568799

Cited in

(11)

• The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
• Strong mixed-integer formulations for the floor layout problem
• Revisiting dynamic programming for finding optimal subtrees in trees
• Model building and location problem solving in a plane with forbidden gaps
• An integrated method to solve the healthcare facility layout problem under area constraints
• Constructing an optimal facility layout to maximize adjacency as a function of common boundary length
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
• Cardinality constrained minimum cut problems: complexity and algorithms.
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
• Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
• New metaheuristic approaches for the edge-weighted k-cardinality tree problem

This page was built for publication: Integer programming approaches to facilities layout models with forbidden areas

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