A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem
From MaRDI portal
Publication:2669523
DOI10.1016/j.cor.2021.105427OpenAlexW3166736013MaRDI QIDQ2669523
Zhipeng Lü, Yang Wang, Zhouxing Su
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105427
Related Items
A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem ⋮ A multi-objective linear programming model for scheduling part families and designing a group layout in cellular manufacturing systems
Uses Software
Cites Work
- Unnamed Item
- A hybrid three-phase approach for the Max-Mean dispersion problem
- A tabu search based memetic algorithm for the Max-Mean dispersion problem
- Heuristic solution approaches for the maximum minsum dispersion problem
- A simple and effective algorithm for the MaxMin diversity problem
- Construction and improvement algorithms for dispersion problems
- A heuristic approach for the max-min diversity problem based on max-clique
- The equitable dispersion problem
- Variable neighborhood search for the heaviest \(k\)-subgraph
- GRASP and path relinking for the max-min diversity problem
- Analytical models for locating undesirable facilities
- Effective metaheuristic algorithms for the minimum differential dispersion problem
- Solving the maximum min-sum dispersion by alternating formulations of two different problems
- A hybrid metaheuristic method for the maximum diversity problem
- Equality measures properties for location problems
- The Sharing Problem
- The Knapsack Sharing Problem
- Heuristic algorithms for the maximum diversity problem
- A Multiobjective Model For Locating Solid Waste Transfer Facilities Using An Empirical Opposition Function
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
