Integer programming approaches to facilities layout models with forbidden areas
From MaRDI portal
Publication:1265901
DOI10.1023/A:1018925728178zbMath0906.90103MaRDI QIDQ1265901
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)
Related Items (8)
Constructing an optimal facility layout to maximize adjacency as a function of common boundary length ⋮ Revisiting dynamic programming for finding optimal subtrees in trees ⋮ The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches ⋮ Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem ⋮ Cardinality constrained minimum cut problems: complexity and algorithms. ⋮ New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
This page was built for publication: Integer programming approaches to facilities layout models with forbidden areas
