Pages that link to "Item:Q4095865"

The following pages link to On Solving A One-Dimensional Space Allocation Problem With Integer Programming (Q4095865):

Displaying 32 items.

• Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem (Q320805) (← 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)
• 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)
• Efficient models for the facility layout problem (Q803026) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• Methods for the one-dimensional space allocation problem (Q916571) (← links)
• A new lower bound for the single row facility layout problem (Q1003774) (← links)
• Recent models and techniques for solving the layout problem (Q1197682) (← links)
• One-dimensional machine location problems in a multi-product flowline with equidistant locations (Q1291754) (← links)
• A heuristic procedure for the single-row facility layout problem (Q1390259) (← 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)
• Flow distance reduction for a multi-product flowline with sets of identical machines (Q1873007) (← links)
• An ant algorithm for the single row layout problem in flexible manufacturing systems (Q1886861) (← links)
• Optimal solutions for the double row layout problem (Q1940444) (← links)
• The single row facility layout problem: state of the art (Q1947218) (← 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)
• On the exact solution of a facility layout problem (Q2496073) (← 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)
• The Constrained Single-Row Facility Layout Problem with Repairing Mechanisms (Q3296257) (← links)
• Optimization of location of interconnected facilities on parallel lines with forbidden zones (Q5100137) (← 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)
• Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem (Q6491337) (← links)