Pages that link to "Item:Q689250"

The following pages link to Good solutions to discrete noxious location problems via metaheuristics (Q689250):

Displaying 24 items.

• An integer programming approach for solving the \(p\)-dispersion problem (Q323154) (← links)
• \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis (Q337587) (← links)
• Heuristic solution approaches for the maximum minsum dispersion problem (Q513174) (← links)
• A simple and effective algorithm for the MaxMin diversity problem (Q646655) (← links)
• A heuristic approach for the max-min diversity problem based on max-clique (Q1010298) (← links)
• The equitable dispersion problem (Q1011261) (← links)
• Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229) (← links)
• GRASP and path relinking for the max-min diversity problem (Q1038285) (← links)
• Integer-friendly formulations for the \(r\)-separation problem (Q1268268) (← links)
• A comparison of \(p\)-dispersion heuristics (Q1342949) (← links)
• Location and layout planning. A survey (Q1372765) (← links)
• Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem (Q1628040) (← links)
• Effective metaheuristic algorithms for the minimum differential dispersion problem (Q1751715) (← links)
• Transmitter location for maximum coverage and constructive-destructive interference management (Q1762133) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Measuring diversity. A review and an empirical analysis (Q2029033) (← links)
• Iterated greedy for the maximum diversity problem (Q2275623) (← links)
• A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
• Iterated tabu search for the maximum diversity problem (Q2381330) (← links)
• Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
• A review on discrete diversity and dispersion maximization from an OR perspective (Q2670513) (← links)
• The Location of Undesirable Facilities (Q5506725) (← links)
• On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
• Formulations and valid inequalities for the capacitated dispersion problem (Q6179719) (← links)