Pages that link to "Item:Q1038285"

The following pages link to GRASP and path relinking for the max-min diversity problem (Q1038285):

Displaying 47 items.

• An integer programming approach for solving the \(p\)-dispersion problem (Q323154) (← links)
• A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
• GRASP and path relinking for the equitable dispersion problem (Q336711) (← links)
• A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem (Q336733) (← links)
• GRASP with evolutionary path-relinking for the capacitated arc routing problem (Q336740) (← links)
• GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
• Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach (Q337222) (← links)
• \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis (Q337587) (← links)
• Variable neighborhood search for the vertex separation problem (Q339678) (← 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)
• Heuristic solution approaches for the maximum minsum dispersion problem (Q513174) (← links)
• Scatter search for the bandpass problem (Q524910) (← links)
• A GRASP with evolutionary path relinking for the truck and trailer routing problem (Q632678) (← links)
• A simple and effective algorithm for the MaxMin diversity problem (Q646655) (← links)
• Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
• Construction and improvement algorithms for dispersion problems (Q726217) (← links)
• Multi-objective variable neighborhood search: an application to combinatorial optimization problems (Q887201) (← links)
• A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems (Q902099) (← links)
• A heuristic approach for the max-min diversity problem based on max-clique (Q1010298) (← links)
• The equitable dispersion problem (Q1011261) (← links)
• Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem (Q1628040) (← links)
• GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem (Q1652080) (← links)
• Heuristics for the capacitated modular hub location problem (Q1652383) (← links)
• Tabu search for the dynamic bipartite drawing problem (Q1652530) (← links)
• A biased random-key genetic algorithm for the tree of hubs location problem (Q1676487) (← links)
• Effective metaheuristic algorithms for the minimum differential dispersion problem (Q1751715) (← links)
• Scatter search for the cutwidth minimization problem (Q1761768) (← links)
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
• Multistart search for the cyclic cutwidth minimization problem (Q2026984) (← links)
• Measuring diversity. A review and an empirical analysis (Q2029033) (← links)
• Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
• The maximum diversity assortment selection problem (Q2040441) (← 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)
• Multiobjective GRASP with path relinking (Q2629598) (← links)
• VNS variants for the Max-Mean dispersion problem (Q2631281) (← 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)
• Hybridizations of GRASP with path relinking for the far from most string problem (Q2811940) (← links)
• Memory and Learning in Metaheuristics (Q2866122) (← links)
• GRASP with path relinking heuristics for the antibandwidth problem (Q3100697) (← links)
• A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem (Q3195327) (← links)
• Computing Minimum Dilation Spanning Trees in Geometric Graphs (Q3196394) (← links)
• Metaheuristics—the metaphor exposed (Q5246818) (← links)
• Heuristics for the capacitated dispersion problem (Q6070413) (← links)
• Formulations and valid inequalities for the capacitated dispersion problem (Q6179719) (← links)