The following pages link to The equitable dispersion problem (Q1011261):
Displaying 43 items.
- Inequity averse optimization in operational research (Q319581) (← links)
- The disruptive anti-covering location problem (Q320083) (← links)
- An integer programming approach for solving the \(p\)-dispersion problem (Q323154) (← links)
- GRASP and path relinking for the equitable dispersion problem (Q336711) (← 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)
- Balancing the arrival times of users in a two-stage location problem (Q512992) (← links)
- Heuristic solution approaches for the maximum minsum dispersion problem (Q513174) (← links)
- Global optimality conditions and optimization methods for quadratic integer programming problems (Q652691) (← 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)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- Dispersing points on intervals (Q1706121) (← links)
- Effective metaheuristic algorithms for the minimum differential dispersion problem (Q1751715) (← links)
- Solving the maximum min-sum dispersion by alternating formulations of two different problems (Q1753455) (← links)
- A hybrid heuristic for the maximum dispersion problem (Q2028755) (← links)
- Measuring diversity. A review and an empirical analysis (Q2029033) (← links)
- Less is more approach in optimization: a road to artificial intelligence (Q2070138) (← links)
- Finding optimal solutions to several gray pattern instances (Q2115324) (← links)
- Fair resource allocation: using welfare-based dominance constraints (Q2242256) (← links)
- Iterated greedy for the maximum diversity problem (Q2275623) (← links)
- A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem (Q2298725) (← links)
- A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
- An exact semidefinite programming approach for the max-mean dispersion problem (Q2410030) (← links)
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766) (← links)
- On the unified dispersion problem: efficient formulations and exact algorithms (Q2629707) (← links)
- Equality measures properties for location problems (Q2629900) (← links)
- VNS variants for the Max-Mean dispersion problem (Q2631281) (← 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)
- Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (Q2669792) (← 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)
- Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem (Q2673245) (← links)
- On the complexity of query result diversification (Q2790132) (← links)
- A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem (Q3195327) (← links)
- Dispersive Equity and Social Risk (Q3982667) (← links)
- (Q4268138) (← links)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
- Heuristics for the capacitated dispersion problem (Q6070413) (← links)
- The equal share proportional solution in a permit sharing problem (Q6168803) (← links)
- Formulations and valid inequalities for the capacitated dispersion problem (Q6179719) (← links)
- Different formulations of the gray pattern problem and their optimal solutions (Q6586256) (← links)
