Pages that link to "Item:Q2890423"
From MaRDI portal
The following pages link to Exploiting Tabu Search Memory in Constrained Problems (Q2890423):
Displayed 8 items.
- Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
- Scheduled penalty variable neighborhood search (Q337204) (← links)
- A new mixed integer programming formulation for facility layout design using flexible bays (Q867930) (← links)
- Pruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives (Q945048) (← links)
- A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays (Q2253379) (← links)
- Multi-objective tabu search using a multinomial probability mass function (Q2572860) (← links)
- MILP Models for Complex System Reliability Redundancy Allocation with Mixed Components (Q3386786) (← links)
- Layout optimization considering production uncertainty and routing flexibility (Q4671330) (← links)