Solving the incremental graph drawing problem by multiple neighborhood solution-based tabu search algorithm.

A fast path relinking algorithm for the min-max edge crossing problem.

A three-phase matheuristic algorithm for the multi-day task assignment problem.

Solving maximum quasi-clique problem by a hybrid artificial bee colony approach.

A two-individual based path-relinking algorithm for the satellite broadcast scheduling problem.

Adaptive memory programming for the dynamic bipartite drawing problem.

A learning-based memetic algorithm for the multiple vehicle pickup and delivery problem with LIFO loading.

Memetic algorithm for the multiple traveling repairman problem with profits.

Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration.

Multi-start iterated tabu search for the minimum weight vertex cover problem.

An ejection chain approach for the quadratic multiple knapsack problem.

A hybrid evolutionary algorithm to solve the job shop scheduling problem.

Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling.

A tabu search/path relinking algorithm to solve the job shop scheduling problem.