Solving the maximum min-sum dispersion by alternating formulations of two different problems
type: Item
instance of: scholarly article
title: Solving the maximum min-sum dispersion by alternating formulations of two different problems
zbMATH Open document ID: 1403.90544
author: Zhazira Amirgaliyeva
author: Nenad Mladenović
author: Raca Todosijević
author: Dragan Urošević
published in: European Journal of Operational Research
publication date: 2018-05-29T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6875782
zbMATH Keywords: metaheuristics
zbMATH Keywords: dispersion problems
zbMATH Keywords: binary quadratic programing
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: variable formulation search
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.12.039
OpenAlex ID: W2562151074
cites work: Maximum diversity/similarity models with extension to part grouping
cites work: Construction and improvement algorithms for dispersion problems
cites work: Tabu search versus GRASP for the maximum diversity problem
cites work: Variable neighborhood search for the heaviest \(k\)-subgraph
cites work: The Knapsack Sharing Problem
cites work: The Sharing Problem
cites work: The discrete p-dispersion problem
cites work: Analytical models for locating undesirable facilities
cites work: Computational aspects of the maximum diversity problem
cites work: Heuristic algorithms for the maximum diversity problem
cites work: Variable space search for graph coloring
cites work: A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
cites work: Formulation space search approach for the teacher/class timetabling problem
cites work: A heuristic for the circle packing problem with a variety of containers
cites work: Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
cites work: Variable neighborhood search
cites work: Reformulation descent applied to circle packing problems
cites work: Formulation Space Search for Circle Packing Problems
cites work: Variable neighbourhood search for bandwidth reduction
cites work: A simple and effective algorithm for the MaxMin diversity problem
cites work: The equitable dispersion problem
cites work: Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
cites work: The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
cites work: An empirical comparison of heuristic methods for creating maximally diverse groups
DOI: 10.1016/J.EJOR.2016.12.039
description: scientific article; zbMATH DE number 6875782