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 34 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)
• A new lower bound for the single row facility layout problem (Q1003774) (← 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)
• 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)
• Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
• An efficient genetic algorithm for single row facility layout (Q2448146) (← links)
• Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (Q2802535) (← links)
• Semidefinite Programming and Constraint Programming (Q2802541) (← links)
• Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
• An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization (Q2883644) (← links)
• On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems (Q2885494) (← links)
• An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
• The Constrained Single-Row Facility Layout Problem with Repairing Mechanisms (Q3296257) (← links)