The following pages link to (Q4365130):
Displayed 16 items.
- A review of chaos-based firefly algorithms: perspectives and research challenges (Q298693) (← links)
- Greedy scheduling with custom-made objectives (Q613772) (← links)
- Scheduling coupled-operation jobs with exact time-lags (Q714025) (← links)
- A unified heuristic for a large class of vehicle routing problems with backhauls (Q819067) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
- A survey on metaheuristics for stochastic combinatorial optimization (Q1024034) (← links)
- Digital data networks design using genetic algorithms (Q1590811) (← links)
- Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
- An improved tabu search approach for solving the job shop scheduling problem with tooling constraints (Q1917279) (← links)
- Diversification strategies in tabu search algorithms for the maximum clique problem (Q1919840) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs (Q1922632) (← links)
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem (Q1969832) (← links)
- Comprehensive optimization of urban rail transit timetable by minimizing total travel times under time-dependent passenger demand and congested conditions (Q2295338) (← links)
- Artificial life techniques for load balancing in computational grids (Q2459370) (← links)
- Algorithms for finding minimum fundamental cycle bases in graphs (Q3439123) (← links)