Pages that link to "Item:Q354626"

The following pages link to A computational study and survey of methods for the single-row facility layout problem (Q354626):

Displaying 16 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)
• Insertion based Lin-Kernighan heuristic for single row facility layout (Q339556) (← links)
• Semidefinite relaxations of ordering problems (Q359627) (← links)
• A polyhedral approach to the single row facility layout problem (Q378107) (← links)
• New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
• A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
• A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation (Q1651538) (← links)
• Improved exact approaches for row layout problems with departments of equal length (Q1651703) (← links)
• Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments (Q1652644) (← links)
• Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
• A \(\beta\)-accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics (Q1681320) (← 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)
• Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem (Q6491337) (← links)