Pages that link to "Item:Q1025229"

The following pages link to Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229):

Displaying 13 items.

• Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach (Q337222) (← links)
• Construction and improvement algorithms for dispersion problems (Q726217) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• Exact approaches for the orderly colored longest path problem: performance comparison (Q1628069) (← links)
• Solving the maximum min-sum dispersion by alternating formulations of two different problems (Q1753455) (← links)
• Variable neighborhood search for the travelling deliveryman problem (Q1942008) (← links)
• Iterated greedy for the maximum diversity problem (Q2275623) (← links)
• A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
• Memetic self-adaptive evolution strategies applied to the maximum diversity problem (Q2448149) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem (Q2669523) (← links)
• A review on discrete diversity and dispersion maximization from an OR perspective (Q2670513) (← links)
• A two-phase tabu search based evolutionary algorithm for the maximum diversity problem (Q2673240) (← links)