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

DOI10.1016/J.EJOR.2016.12.039MaRDI QIDQ1753455zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• A heuristic for solving the maximum dispersion problem
• VNS variants for the Max-Mean dispersion problem
• Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
• A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem
• Heuristic solution approaches for the maximum minsum dispersion problem

Cites work

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

Cited in

(12)

• Packing a fixed number of identical circles in a circular container with circular prohibited areas
• 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 parallel variable neighborhood search approach for the obnoxious p‐median problem
• The balanced maximally diverse grouping problem with block constraints
• Packing unequal rectangles and squares in a fixed size circular container using formulation space search
• Heuristic solution approaches for the maximum minsum dispersion problem
• A review on discrete diversity and dispersion maximization from an OR perspective
• Exact algorithms for the max-min dispersion problem
• Maximizing single attribute diversity in group selection
• Less is more approach in optimization: a road to artificial intelligence
• A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753455)