Pages that link to "Item:Q1915966"

The following pages link to A comparison of neighborhood search techniques for multi-objective combinatorial problems (Q1915966):

Displaying 8 items.

• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
• A multi-objective particle swarm for a flow shop scheduling problem (Q867030) (← links)
• Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems (Q880496) (← links)
• A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. (Q1423450) (← links)
• Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic (Q1848643) (← links)
• Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic (Q1887952) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times (Q2432854) (← links)