The equitable dispersion problem
From MaRDI portal
Publication:1011261
DOI10.1016/j.ejor.2008.06.005zbMath1157.90539OpenAlexW2154629615MaRDI QIDQ1011261
Oleg A. Prokopyev, Dayna L. Martinez-Torres, Nan Kong
Publication date: 8 April 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.06.005
Related Items (39)
Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem ⋮ On the unified dispersion problem: efficient formulations and exact algorithms ⋮ Equality measures properties for location problems ⋮ VNS variants for the Max-Mean dispersion problem ⋮ Inequity averse optimization in operational research ⋮ The disruptive anti-covering location problem ⋮ An integer programming approach for solving the \(p\)-dispersion problem ⋮ GRASP and path relinking for the equitable dispersion problem ⋮ A hybrid three-phase approach for the Max-Mean dispersion problem ⋮ A tabu search based memetic algorithm for the Max-Mean dispersion problem ⋮ A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem ⋮ Fractional 0-1 programming: applications and algorithms ⋮ Tabu search guided by reinforcement learning for the max-mean dispersion problem ⋮ An exact semidefinite programming approach for the max-mean dispersion problem ⋮ A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem ⋮ Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS ⋮ A review on discrete diversity and dispersion maximization from an OR perspective ⋮ A two-phase tabu search based evolutionary algorithm for the maximum diversity problem ⋮ Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem ⋮ Heuristics for the capacitated dispersion problem ⋮ A new branch-and-bound algorithm for the maximum edge-weighted clique problem ⋮ Formulations and valid inequalities for the capacitated dispersion problem ⋮ Dispersing points on intervals ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ Global optimality conditions and optimization methods for quadratic integer programming problems ⋮ Fair resource allocation: using welfare-based dominance constraints ⋮ Balancing the arrival times of users in a two-stage location problem ⋮ Heuristic solution approaches for the maximum minsum dispersion problem ⋮ Effective metaheuristic algorithms for the minimum differential dispersion problem ⋮ Solving the maximum min-sum dispersion by alternating formulations of two different problems ⋮ Iterated greedy for the maximum diversity problem ⋮ On the Complexity of Query Result Diversification ⋮ A hybrid heuristic for the maximum dispersion problem ⋮ Measuring diversity. A review and an empirical analysis ⋮ Construction and improvement algorithms for dispersion problems ⋮ A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem ⋮ Less is more approach in optimization: a road to artificial intelligence ⋮ Finding optimal solutions to several gray pattern instances ⋮ A hybrid metaheuristic method for the maximum diversity problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Good solutions to discrete noxious location problems via metaheuristics
- The complexity of regular subgraph recognition
- The discrete p-dispersion problem
- GRASP and path relinking for the max-min diversity problem
- Analytical models for locating undesirable facilities
- A note on a global approach for general 0-1 fractional programming
- Computational aspects of the maximum diversity problem
- Approximation algorithms for maximum dispersion
- Greedy randomized adaptive search procedures
- Global optimization of 0-1 hyperbolic programs
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- Lower bound improvement and forcing rule for quadratic binary programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Maximum diversity/similarity models with extension to part grouping
- An empirical comparison of heuristic methods for creating maximally diverse groups
- An Analysis of Network Location Problems with Distance Constraints
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- The Sharing Problem
- The Knapsack Sharing Problem
- Heuristic and Special Case Algorithms for Dispersion Problems
- Heuristic algorithms for the maximum diversity problem
- Exact Solution of the Quadratic Knapsack Problem
- A Multiobjective Model For Locating Solid Waste Transfer Facilities Using An Empirical Opposition Function
- Lagrangian solution of maximum dispersion problems
This page was built for publication: The equitable dispersion problem
