Pages that link to "Item:Q2255905"

The following pages link to Simulated annealing and tabu search approaches for the Corridor Allocation Problem (Q2255905):

Displaying 12 items.

• Parameter identification for a nonlinear enzyme-catalytic dynamic system with time-delays (Q496611) (← links)
• A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes (Q724035) (← links)
• Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
• Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions (Q1753550) (← links)
• A decomposition-based algorithm for the double row layout problem (Q1988733) (← links)
• Exact approaches for the combined cell layout problem (Q2098024) (← links)
• Decorous combinatorial lower bounds for row layout problems (Q2189888) (← links)
• An efficient variable neighborhood search for the space-free multi-row facility layout problem (Q2242375) (← links)
• New exact approaches to row layout problems (Q2295979) (← links)
• Component allocation cost minimization for a multistate computer network subject to a reliability threshold using tabu search (Q2515273) (← links)
• Pharmacy duty scheduling problem (Q2811939) (← links)
• Corridor Allocation as a Constrained Optimization Problem Using a Permutation-Based Multi-objective Genetic Algorithm (Q3296256) (← links)