Pages that link to "Item:Q2379521"

The following pages link to A branch and bound algorithm for the maximum diversity problem (Q2379521):

Displaying 25 items.

• Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem (Q337120) (← links)
• Branch and bound for the cutwidth minimization problem (Q339558) (← links)
• A tabu search based memetic algorithm for the Max-Mean dispersion problem (Q342388) (← links)
• Heuristic solution approaches for the maximum minsum dispersion problem (Q513174) (← links)
• Construction and improvement algorithms for dispersion problems (Q726217) (← links)
• A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← links)
• An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation (Q1728503) (← links)
• Measuring diversity. A review and an empirical analysis (Q2029033) (← links)
• The maximum diversity assortment selection problem (Q2040441) (← links)
• A note on computational approaches for the antibandwidth problem (Q2051212) (← links)
• \(t\)-linearization for the maximum diversity problem (Q2230803) (← links)
• A Davidson college multi-objective assignment problem: a case study (Q2257101) (← links)
• Iterated greedy for the maximum diversity problem (Q2275623) (← links)
• A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
• An exact semidefinite programming approach for the max-mean dispersion problem (Q2410030) (← 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)
• Maximizing single attribute diversity in group selection (Q2678607) (← 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)
• An exact cutting plane method for the Euclidean max-sum diversity problem (Q6096568) (← links)
• Formulations and valid inequalities for the capacitated dispersion problem (Q6179719) (← links)