Heuristic and Special Case Algorithms for Dispersion Problems
From MaRDI portal
Publication:4301294
DOI10.1287/OPRE.42.2.299zbMATH Open0805.90074OpenAlexW1965734368MaRDI QIDQ4301294FDOQ4301294
Authors: S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi 
Publication date: 31 January 1995
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1634b7d3dd67daf1067d97185319c44f8a7d227e
Recommendations
polynomial-time algorithmdispersion problemnondominated solutionsmultiobjective decision makingnear-optimal solutions
Cited In (79)
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- Finding connected \(k\)-subgraphs with high density
- Maximum dispersion problem in dense graphs
- A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
- Approximation algorithms for maximum dispersion
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Iterated tabu search for the maximum diversity problem
- Approximation algorithms for dispersion problems
- A Lagrangian relaxation approach to the edge-weighted clique problem
- Efficient Approximations for the Online Dispersion Problem
- Algorithms for \(k\)-dispersion for points in convex position in the plane
- A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs
- Polynomial algorithms for p-dispersion problems in a planar Pareto Front
- Title not available (Why is that?)
- Approximating the maximum quadratic assignment problem
- Measuring diversity. A review and an empirical analysis
- An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem
- New approximation algorithms for weighted maximin dispersion problem with box or ball constraints
- Complexity of finding dense subgraphs
- Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem
- Title not available (Why is that?)
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
- Minimum-diameter covering problems
- An integer programming approach for solving the \(p\)-dispersion problem
- The maximum diversity assortment selection problem
- Discrete location problems with push-pull objectives
- Title not available (Why is that?)
- The densest \(k\)-subgraph problem on clique graphs
- Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town?
- Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach
- \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis
- The discrete p-dispersion problem
- The equitable dispersion problem
- Computational geometric aspects of rhythm, melody, and voice-leading
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- Heuristic solution approaches for the maximum minsum dispersion problem
- Integer-friendly formulations for the \(r\)-separation problem
- A two-phase tabu search based evolutionary algorithm for the maximum diversity problem
- A linear time approximation scheme for computing geometric maximum \(k\)-star
- Solving the anti-covering location problem using Lagrangian relaxation
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- A new family of facet defining inequalities for the maximum edge-weighted clique problem
- Compact location problems
- Maximization problems of balancing submodular relevance and supermodular diversity
- Construction and improvement algorithms for dispersion problems
- On solving the densest \(k\)-subgraph problem on large graphs
- A comparison of \(p\)-dispersion heuristics
- Lagrangian solution of maximum dispersion problems
- The maximal dispersion problem and the ``first point outside the neighbourhood heuristic
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
- A hybrid metaheuristic method for the maximum diversity problem
- An extended formulation approach to the edge-weighted maximal clique problem
- Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
- Dispersing points on intervals
- Subset selection from large datasets for kriging modeling
- A review on algorithms for maximum clique problems
- Facility dispersion and remote subgraphs
- A hybrid heuristic for the maximum dispersion problem
- Approximate solutions of continuous dispersion problems
- On the unified dispersion problem: efficient formulations and exact algorithms
- The hub location and pricing problem
- Dispersion with connectivity in wireless mesh networks
- Truthful Mechanisms for Matching and Clustering in an Ordinal World
- Title not available (Why is that?)
- Dispersing and grouping points on planar segments
- Dispersion problem on a convex polygon
- Away from each other
- An improved analysis of local search for max-sum diversification
- Weakly Submodular Function Maximization Using Local Submodularity Ratio.
- The Discrete Heal Algorithm With Intermediate Goods
- Result diversification by multi-objective evolutionary algorithms with theoretical guarantees
- Max-min dispersion on a line
- Maximizing single attribute diversity in group selection
- New algorithms for a simple measure of network partitioning
- An exact cutting plane method for the Euclidean max-sum diversity problem
- A graph-based active learning method for classification of remote sensing images
- 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
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)
