The following pages link to (Q4332851):
Displaying 11 items.
- Greedy random adaptive memory programming search for the capacitated clustering problem (Q707129) (← links)
- A rough set approach to feature selection based on scatter search metaheuristic (Q741887) (← links)
- A branch-and-bound algorithm for the mini-max spanning forest problem (Q1278942) (← links)
- CHECKCOL: improved local search for graph coloring (Q2458929) (← links)
- Product line selection and pricing analysis: impact of genetic relaxations (Q2489113) (← links)
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem (Q2489303) (← links)
- Noising methods for a clique partitioning problem (Q2489901) (← links)
- Flowshop scheduling research after five decades (Q2572844) (← links)
- Global Optimization in Practice:State of the Art and Perspectives (Q3565460) (← links)
- Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives (Q5270058) (← links)
- Nature-Inspired Metaheuristics Search Algorithms for Solving the Economic Load Dispatch Problem of Power System: A Comparison Study (Q5855616) (← links)
