Construction and improvement algorithms for dispersion problems

No abstract is available for this paper.

• Publication year

  2015

• Venue

  European Journal of Operational Research

• Publication date

  2015-04-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.ejor.2014.09.058
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A hybrid metaheuristic method for the Maximum Diversity Problem

  2013cited by this paper
• GRASP and path relinking for the equitable dispersion problem

  2013cited by this paper
• Learnable tabu search guided by estimation of distribution for maximum diversity problems

  2012cited by this paper
• A simple and effective algorithm for the MaxMin diversity problem

  2011cited by this paper
• Heuristics and metaheuristics for the maximum diversity problem

  2011cited by this paper
• Comparing local search metaheuristics for the maximum diversity problem

  2011influential reference
• A branch and bound algorithm for the maximum diversity problem

  2010cited by this paper
• GRASP and path relinking for the max-min diversity problem

  2010cited by this paper
• Programming Models for Facility Dispersion: The p‐Dispersion and Maxisum Dispersion Problems

  2010cited by this paper
• Optimal results and tight bounds for the maximum diversity problem

  2009cited by this paper
• Hybrid heuristics for the maximum diversity problem

  2009cited by this paper
• Variable neighborhood search for the heaviest k-subgraph

  2009influential reference
• Composing medical crews with equity and efficiency

  2009influential reference
• A heuristic approach for the max-min diversity problem based on max-clique

  2009cited by this paper
• Variable Neighborhood Search

  2009cited by this paper
• The equitable dispersion problem

  2009influential reference
• Variable neighborhood search

  2008cited by this paper
• Simple ingredients leading to very efficient heuristics for the maximum clique problem

  2008influential reference
• Tabu Search versus GRASP for the maximum diversity problem

  2008cited by this paper
• New heuristics for the maximum diversity problem

  2007cited by this paper
• Tabu search and GRASP for the maximum diversity problem

  2007influential reference
• Iterated tabu search for the maximum diversity problem

  2007cited by this paper
• Upper bounds and exact algorithms for p-dispersion problems

  2006cited by this paper
• Tabu Search vs . GRASP for the Maximum Diversity Problem

  2005influential reference
• Maximum diversity/similarity models with extension to part grouping

  2005cited by this paper
• An empirical comparison of heuristic methods for creating maximally diverse groups

  1998cited by this paper
• Heuristic algorithms for the maximum diversity problem

  1998cited by this paper
• Tabu Search

  1997cited by this paper
• Analyzing and Modeling the Maximum Diversity Problem by Zero‐One Programming*

  1993cited by this paper
• Correlation in Landscapes of Combinatorial Optimization Problems

  1992cited by this paper
• Comparison Of Four Models For dispersing Facilities

  1991cited by this paper
• A Tabu Search Heuristic for the Vehicle Routing Problem

  1991cited by this paper
• The discrete p-dispersion problem

  1990influential reference
• Analytical models for locating undesirable facilities

  1989cited by this paper
• Future paths for integer programming and links to artificial intelligence

  1986cited by this paper
• Individual Comparisons by Ranking Methods

  1945cited by this paper

• A Biased-Randomized Algorithm for the Bi-Objective Capacitated Dispersion Problem with Symmetries

  2026cites this paper
• Solution-based versus attribute-based tabu search for binary integer programming

  2025cites this paper
• A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values

  2022cites this paper
• Maximizing single attribute diversity in group selection

  2022cites this paper
• Discrete diversity and dispersion maximization. A review and an empirical analysis from an OR perspective

  2021cites this paper
• A review on discrete diversity and dispersion maximization from an OR perspective

  2021cites this paper
• A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem

  2021cites this paper
• The balanced maximally diverse grouping problem with block constraints

  2021cites this paper
• Tabu search guided by reinforcement learning for the max-mean dispersion problem

  2020cites this paper
• A study of two evolutionary/tabu search approaches for the generalized max-mean dispersion problem

  2020cites this paper
• Intensi cation-driven tabu search for the minimum di erential dispersion problem

  2019influential citation
• Intensification-driven tabu search for the minimum differential dispersion problem

  2019cites this paper
• A new use of the ant system algorithm for the max-mean dispersion problem

  2019cites this paper
• A Hybrid Metaheuristic of Integrating Estimation of Distribution Algorithm with Tabu Search for the Max-Mean Dispersion Problem

  2019cites this paper
• A Tabu Search Approach With Dynamical Neighborhood Size for Solving the Maximum Min-Sum Dispersion Problem

  2019cites this paper
• Solution-based tabu search for the maximum min-sum dispersion problem

  2018influential citation
• An effective multi-wave algorithm for solving the max-mean dispersion problem

  2018cites this paper
• Diversity and Equity Models

  2018cites this paper
• Solving the maximum min-sum dispersion by alternating formulations of two different problems

  2017cites this paper
• Effective metaheuristic algorithms for the minimum differential dispersion problem

  2017cites this paper
• An iterated local search algorithm for the minimum differential dispersion problem

  2016cites this paper
• A tabu search based memetic algorithm for the max-mean dispersion problem

  2016influential citation
• On memetic search for the max-mean dispersion problem

  2015cites this paper
• Expert Systems With Applications

  year unknowncites this paper