Pages that link to "Item:Q2506218"

The following pages link to Hybrid population-based algorithms for the bi-objective quadratic assignment problem (Q2506218):

Displaying 7 items.

• Anytime Pareto local search (Q319099) (← links)
• Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
• Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
• A bi-objective heuristic approach for green identical parallel machine scheduling (Q2029023) (← links)
• Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms (Q2029299) (← links)
• Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach (Q2185520) (← links)
• Multi-objective memetic algorithm: comparing artificial neural networks and pattern search filter method approaches (Q3087846) (← links)