The following pages link to M. Fatih Tasgetiren (Q506325):
Displaying 9 items.
- A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326) (← links)
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
- Solving 0-1 bi-objective multi-dimensional knapsack problems using binary genetic algorithm (Q2093908) (← links)
- Metaheuristic algorithms for the hybrid flowshop scheduling problem (Q2273670) (← links)
- Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach (Q2668611) (← links)
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem (Q3430248) (← links)
- Smallest Position Value Approach (Q3649625) (← links)
- Discrete/Binary Approach (Q3649626) (← links)
- (Q5437767) (← links)