Pages that link to "Item:Q2901038"

The following pages link to Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes (Q2901038):

Displaying 13 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)
• 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 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)
• Generalized Benders' decomposition for topology optimization problems (Q652657) (← links)