Pages that link to "Item:Q378107"
From MaRDI portal
The following pages link to A polyhedral approach to the single row facility layout problem (Q378107):
Displaying 33 items.
- Single row layout models (Q319651) (← links)
- Fast local search for single row facility layout (Q319872) (← links)
- Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem (Q320805) (← links)
- A parallel ordering problem in facilities layout (Q336660) (← links)
- Insertion based Lin-Kernighan heuristic for single row facility layout (Q339556) (← links)
- The corridor allocation problem (Q339697) (← links)
- A computational study and survey of methods for the single-row facility layout problem (Q354626) (← links)
- Semidefinite relaxations of ordering problems (Q359627) (← links)
- A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088) (← links)
- Single row facility layout problem using a permutation-based genetic algorithm (Q545111) (← links)
- A polyhedral study of triplet formulation for single row facility layout problem (Q602769) (← links)
- A new lower bound for the single row facility layout problem (Q1003774) (← links)
- An improved mixed-integer programming model for the double row layout of facilities (Q1733337) (← links)
- A GRASP algorithm for solving large-scale single row facility layout problems (Q1734823) (← links)
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions (Q1753550) (← links)
- Optimal linear arrangements using betweenness variables (Q1762457) (← links)
- Optimal solutions for the double row layout problem (Q1940444) (← links)
- The single row facility layout problem: state of the art (Q1947218) (← links)
- Exact approaches for the combined cell layout problem (Q2098024) (← links)
- Decorous combinatorial lower bounds for row layout problems (Q2189888) (← links)
- A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem (Q2239887) (← links)
- An efficient tabu algorithm for the single row facility layout problem (Q2270298) (← links)
- New exact approaches to row layout problems (Q2295979) (← links)
- An efficient genetic algorithm for single row facility layout (Q2448146) (← links)
- On the exact solution of a facility layout problem (Q2496073) (← links)
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes (Q2901038) (← links)
- An Exact Approach to the One-Dimensional Facility Layout Problem (Q3392227) (← links)
- Provably near-optimal solutions for very large single-row facility layout problems (Q3396400) (← 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)
- Construction heuristics for the single row layout problem with machine-spanning clearances (Q5884347) (← links)
- See the light: Optimization of put‐to‐light order picking systems (Q6057928) (← links)
- Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem (Q6491337) (← links)
