Heuristic and Special Case Algorithms for Dispersion Problems
From MaRDI portal
Recommendations
Cited in
(96)- The equitable dispersion problem
- Integer-friendly formulations for the \(r\)-separation problem
- An extended formulation approach to the edge-weighted maximal clique problem
- A comparison of \(p\)-dispersion heuristics
- Minimum dispersion problems
- Solving the anti-covering location problem using Lagrangian relaxation
- Approximation algorithms for maximum dispersion
- Compact location problems
- Approximating the maximum quadratic assignment problem
- Complexity of finding dense subgraphs
- Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
- Dispersing points on intervals
- Dispersion with connectivity in wireless mesh networks
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
- A linear time approximation scheme for computing geometric maximum \(k\)-star
- Facility dispersion problems under capacity and cost constraints
- A hybrid heuristic for the maximum dispersion problem
- Measuring diversity. A review and an empirical analysis
- An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem
- The maximum diversity assortment selection problem
- New approximation algorithms for weighted maximin dispersion problem with box or ball constraints
- Maximization problems of balancing submodular relevance and supermodular diversity
- The hub location and pricing problem
- Result diversification by multi-objective evolutionary algorithms with theoretical guarantees
- Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem
- Dispersing and grouping points on planar segments
- Max-Min 3-Dispersion problems
- A hybrid metaheuristic method for the maximum diversity problem
- A new family of facet defining inequalities for the maximum edge-weighted clique problem
- Iterated tabu search for the maximum diversity problem
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
- Finding connected \(k\)-subgraphs with high density
- The densest \(k\)-subgraph problem on clique graphs
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- On the unified dispersion problem: efficient formulations and exact algorithms
- A review on algorithms for maximum clique problems
- The maximal dispersion problem and the ``first point outside the neighbourhood heuristic
- A two-phase tabu search based evolutionary algorithm for the maximum diversity problem
- Maximizing single attribute diversity in group selection
- New algorithms for a simple measure of network partitioning
- Approximation algorithms for dispersion problems
- scientific article; zbMATH DE number 1670536 (Why is no real title available?)
- Truthful Mechanisms for Matching and Clustering in an Ordinal World
- An integer programming approach for solving the p-dispersion problem
- The Discrete Heal Algorithm With Intermediate Goods
- Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
- p-median and p-dispersion problems: a bi-criteria analysis
- Subset selection from large datasets for kriging modeling
- scientific article; zbMATH DE number 36716 (Why is no real title available?)
- scientific article; zbMATH DE number 177561 (Why is no real title available?)
- On inclusionwise maximal and maximum cardinality k-clubs in graphs
- Minimum-diameter covering problems
- A graph-based active learning method for classification of remote sensing images
- Efficient approximations for the online dispersion problem
- scientific article; zbMATH DE number 913711 (Why is no real title available?)
- A multiple‐objective dispersion problem
- Lagrangian solution of maximum dispersion problems
- Facility dispersion and remote subgraphs
- Diversity maximization in doubling metrics
- An improved analysis of local search for max-sum diversification
- Heuristic solution approaches for the maximum minsum dispersion problem
- A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
- On solving the densest \(k\)-subgraph problem on large graphs
- Max-min dispersion on a line
- Maximum dispersion problem in dense graphs
- A Lagrangian relaxation approach to the edge-weighted clique problem
- Polynomial algorithms for p-dispersion problems in a planar Pareto Front
- Weakly Submodular Function Maximization Using Local Submodularity Ratio.
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Away from each other
- An exact cutting plane method for the Euclidean max-sum diversity problem
- Obtaining approximately optimal and diverse solutions via dispersion
- New algorithms for a simple measure of network partitioning
- Complexity and approximability of certain bicriteria location problems
- Algorithms for \(k\)-dispersion for points in convex position in the plane
- Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town?
- Dispersion problem on a convex polygon
- Riesz energy minimization facility location problem in the plane: complexity and a polynomial-time approximation scheme
- Computing diverse and nice triangulations
- On the hardness and approximation of the densest k-subgraph problem in parameterized metric graphs
- From metric to general graphs: FPT constant-factor approximation algorithms for three location problems
- Finding diverse strings and longest common subsequences in a graph
- Algorithms for minimizing the movements of spreading points in linear domains
- Locating two facilities on a square with a minimum distance requirement
- Discrete location problems with push-pull objectives
- Locating two facilities on a square with a minimum distance requirement
- Diverse data selection under fairness constraints
- Algorithms for k-dispersion for points in convex position in the plane
- Construction and improvement algorithms for dispersion problems
- A couple of simple algorithms for k-dispersion
- Max-min four-dispersion problems
- Computational geometric aspects of rhythm, melody, and voice-leading
- Approximate solutions of continuous dispersion problems
- The discrete p-dispersion problem
- A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs
This page was built for publication: Heuristic and Special Case Algorithms for Dispersion Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4301294)
