Pages that link to "Item:Q2381330"

The following pages link to Iterated tabu search for the maximum diversity problem (Q2381330):

Displaying 24 items.

• A tabu search based memetic algorithm for the Max-Mean dispersion problem (Q342388) (← links)
• A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088) (← links)
• Modified particle swarm optimization algorithm with simulated annealing behavior and its numerical verification (Q426984) (← links)
• Heuristic solution approaches for the maximum minsum dispersion problem (Q513174) (← links)
• A simple and effective algorithm for the MaxMin diversity problem (Q646655) (← links)
• Construction and improvement algorithms for dispersion problems (Q726217) (← links)
• A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) (← links)
• Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229) (← links)
• A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
• A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510) (← links)
• Measuring diversity. A review and an empirical analysis (Q2029033) (← links)
• Maximization problems of balancing submodular relevance and supermodular diversity (Q2070370) (← links)
• Finding optimal solutions to several gray pattern instances (Q2115324) (← links)
• Iterated greedy for the maximum diversity problem (Q2275623) (← links)
• A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
• An improved exact algorithm for least-squares unidimensional scaling (Q2375707) (← links)
• A branch and bound algorithm for the maximum diversity problem (Q2379521) (← 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 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)
• A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
• Heuristics for the capacitated dispersion problem (Q6070413) (← links)
• Different formulations of the gray pattern problem and their optimal solutions (Q6586256) (← links)