Pages that link to "Item:Q2892276"
From MaRDI portal
The following pages link to A New Mathematical-Programming Framework for Facility-Layout Design (Q2892276):
Displayed 16 items.
- An improved two-stage optimization-based framework for unequal-areas facility layout (Q331972) (← links)
- On the unboundedness of facility layout problems (Q604804) (← links)
- An approximation algorithm for dissecting a rectangle into rectangles with specified areas (Q869574) (← links)
- A nonlinear optimization methodology for VLSI fixed-outline floorplanning (Q1016045) (← links)
- Applying ant system for solving unequal area facility layout problems (Q1040995) (← links)
- Combining Wang-Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem (Q1683146) (← links)
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions (Q1753550) (← links)
- Mathematical optimization approach for facility layout on several rows (Q1996730) (← links)
- A convex optimisation framework for the unequal-areas facility layout problem (Q2275810) (← links)
- An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems (Q2290902) (← links)
- Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
- Constructing an optimal facility layout to maximize adjacency as a function of common boundary length (Q5058746) (← links)
- PACKING SOFT RECTANGLES (Q5493900) (← links)
- Strong mixed-integer formulations for the floor layout problem (Q5882271) (← links)
- Beating the SDP bound for the floor layout problem: a simple combinatorial idea (Q5882276) (← links)
- Solution of a Facility Layout Problem in a Final Assembly Workshop using Constraint Programming (Q6102811) (← links)