A heuristic for solving the maximum dispersion problem

DOI10.1007/978-3-319-55702-1_54MaRDI QIDQ4596481zbMATH OpenOpenAlexFDO

Authors Mahdi Moeini, Oliver Wendt

Publication date 1 December 2017

Published in Operations Research Proceedings 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-55702-1_54

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• VNS variants for the Max-Mean dispersion problem
• A hybrid heuristic for the maximum dispersion problem
• A hybrid heuristic approach based on a quadratic knapsack formulation for the max-mean dispersion problem
• A hybrid three-phase approach for the Max-Mean dispersion problem
• Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach

Cited in

(11)

• Solving the maximum min-sum dispersion by alternating formulations of two different problems
• A hybrid heuristic for the maximum dispersion problem
• An exact semidefinite programming approach for the max-mean dispersion problem
• VNS variants for the Max-Mean dispersion problem
• The maximal dispersion problem and the ``first point outside the neighbourhood heuristic
• A hybrid heuristic approach based on a quadratic knapsack formulation for the max-mean dispersion problem
• A hybrid three-phase approach for the Max-Mean dispersion problem
• scientific article; zbMATH DE number 913711 (Why is no real title available?)
• Heuristic solution approaches for the maximum minsum dispersion problem
• Solving Generalized Maximum Dispersion with Linear Programming
• Exact algorithms for the max-min dispersion problem

Describes a project that uses

Uses Software

• Gurobi

This page was built for publication: A heuristic for solving the maximum dispersion problem

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