Solving the maximum min-sum dispersion by alternating formulations of two different problems

DOI10.1016/j.ejor.2016.12.039zbMath1403.90544OpenAlexW2562151074MaRDI QIDQ1753455

Raca Todosijević, Dragan Urošević, Zhazira Amirgaliyeva, Nenad Mladenović

Publication date: 29 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.12.039

zbMATH Keywords

metaheuristicsvariable neighborhood searchdispersion problemsbinary quadratic programingvariable formulation search

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (10)

Packing unequal rectangles and squares in a fixed size circular container using formulation space search ⋮ 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 ⋮ Maximizing single attribute diversity in group selection ⋮ A parallel variable neighborhood search approach for the obnoxious p‐median problem ⋮ The balanced maximally diverse grouping problem with block constraints ⋮ Less is more approach in optimization: a road to artificial intelligence ⋮ Packing a fixed number of identical circles in a circular container with circular prohibited areas ⋮ A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values

Cites Work

• Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
• The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
• A heuristic for the circle packing problem with a variety of containers
• A simple and effective algorithm for the MaxMin diversity problem
• Construction and improvement algorithms for dispersion problems
• The discrete p-dispersion problem
• Tabu search versus GRASP for the maximum diversity problem
• Variable space search for graph coloring
• A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
• The equitable dispersion problem
• Variable neighborhood search for the heaviest \(k\)-subgraph
• Analytical models for locating undesirable facilities
• Computational aspects of the maximum diversity problem
• Variable neighborhood search
• Reformulation descent applied to circle packing problems
• Variable neighbourhood search for bandwidth reduction
• Maximum diversity/similarity models with extension to part grouping
• An empirical comparison of heuristic methods for creating maximally diverse groups
• Formulation space search approach for the teacher/class timetabling problem
• The Sharing Problem
• The Knapsack Sharing Problem
• Heuristic algorithms for the maximum diversity problem
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
• Formulation Space Search for Circle Packing Problems

This page was built for publication: Solving the maximum min-sum dispersion by alternating formulations of two different problems