Pages that link to "Item:Q3396400"
From MaRDI portal
The following pages link to Provably near-optimal solutions for very large single-row facility layout problems (Q3396400):
Displaying 33 items.
- A semidefinite optimization-based approach for global optimization of multi-row facility layout (Q319523) (← links)
- 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)
- A computational study and survey of methods for the single-row facility layout problem (Q354626) (← links)
- Semidefinite relaxations of ordering problems (Q359627) (← links)
- A polyhedral approach to the single row facility layout problem (Q378107) (← links)
- A polyhedral study of triplet formulation for single row facility layout problem (Q602769) (← links)
- On the unboundedness of facility layout problems (Q604804) (← links)
- Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
- A GRASP algorithm for solving large-scale single row facility layout problems (Q1734823) (← links)
- Optimal solutions for the double row layout problem (Q1940444) (← links)
- The single row facility layout problem: state of the art (Q1947218) (← links)
- Mathematical optimization approach for facility layout on several rows (Q1996730) (← 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)
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem (Q2255905) (← 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)
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions (Q2568330) (← links)
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (Q2802535) (← links)
- Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems (Q2885494) (← links)
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes (Q2901038) (← 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)
- Global optimization (Q5896995) (← links)
- Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem (Q6491337) (← links)