Pages that link to "Item:Q2568330"

The following pages link to A semidefinite optimization approach for the single-row layout problem with unequal dimensions (Q2568330):

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)
• Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm (Q337195) (← 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)
• 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)
• Improved exact approaches for row layout problems with departments of equal length (Q1651703) (← 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 solutions for the double row layout problem (Q1940444) (← links)
• The single row facility layout problem: state of the art (Q1947218) (← links)
• A decomposition-based algorithm for the double row layout problem (Q1988733) (← links)
• Mathematical optimization approach for facility layout on several rows (Q1996730) (← 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)
• An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (Q2514881) (← 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)
• A Monte Carlo simulation based heuristic procedure for solving dynamic line layout problems for facilities using conventional material handling devices (Q3163315) (← links)
• The double row layout problem (Q3163744) (← links)
• Corridor Allocation as a Constrained Optimization Problem Using a Permutation-Based Multi-objective Genetic Algorithm (Q3296256) (← links)
• The Constrained Single-Row Facility Layout Problem with Repairing Mechanisms (Q3296257) (← links)
• Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem (Q6491337) (← links)