An exact semidefinite programming approach for the max-mean dispersion problem
From MaRDI portal
Publication:2410030
DOI10.1007/s10878-016-0065-1zbMath1383.90030OpenAlexW2508920162MaRDI QIDQ2410030
Fabio Salassa, Michele Garraffa, Frederico Della Croce
Publication date: 17 October 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0065-1
Related Items (4)
Tabu search guided by reinforcement learning for the max-mean dispersion problem ⋮ A review on discrete diversity and dispersion maximization from an OR perspective ⋮ An exact cutting plane method for the Euclidean max-sum diversity problem ⋮ A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- GRASP and path relinking for the equitable dispersion problem
- A hybrid three-phase approach for the Max-Mean dispersion problem
- A tabu search based memetic algorithm for the Max-Mean dispersion problem
- Copositivity and constrained fractional quadratic problems
- The quadratic knapsack problem -- a survey
- A heuristic approach for the max-min diversity problem based on max-clique
- The equitable dispersion problem
- GRASP and path relinking for the max-min diversity problem
- Computational aspects of the maximum diversity problem
- Semidefinite programming relaxations for the quadratic assignment problem
- A semidefinite programming approach to the quadratic knapsack problem
- A polyhedral branch-and-cut approach to global optimization
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- A branch and bound algorithm for the maximum diversity problem
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- VNS variants for the Max-Mean dispersion problem
- Hybrid heuristics for the maximum diversity problem
- Minimal ratio spanning trees
- Fractional knapsack problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Heuristic algorithms for the maximum diversity problem
- CSDP, A C library for semidefinite programming
- A Spectral Bundle Method for Semidefinite Programming
- A Linear Fractional Semidefinite Relaxation Approach to Maximum-Likelihood Detection of Higher-Order QAM OSTBC in Unknown Channels
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- An Interior-Point Method for Semidefinite Programming
This page was built for publication: An exact semidefinite programming approach for the max-mean dispersion problem
