Pages that link to "Item:Q1010298"

The following pages link to A heuristic approach for the max-min diversity problem based on max-clique (Q1010298):

Displaying 17 items.

• An integer programming approach for solving the \(p\)-dispersion problem (Q323154) (← links)
• Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach (Q337222) (← links)
• A hybrid three-phase approach for the Max-Mean dispersion problem (Q342328) (← links)
• A tabu search based memetic algorithm for the Max-Mean dispersion problem (Q342388) (← links)
• A simple and effective algorithm for the MaxMin diversity problem (Q646655) (← links)
• Construction and improvement algorithms for dispersion problems (Q726217) (← links)
• Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem (Q1628040) (← links)
• Dispersion with connectivity in wireless mesh networks (Q1716989) (← links)
• Effective metaheuristic algorithms for the minimum differential dispersion problem (Q1751715) (← links)
• A new compact formulation for the discrete \(p\)-dispersion problem (Q1752169) (← links)
• A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem (Q2298725) (← links)
• An exact semidefinite programming approach for the max-mean dispersion problem (Q2410030) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• Tabu search guided by reinforcement learning for the max-mean dispersion problem (Q2666721) (← links)
• A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem (Q2669523) (← links)
• Depth-first simplicial partition for copositivity detection, with an application to MaxClique (Q3093056) (← links)
• A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem (Q3195327) (← links)