Heuristic and Special Case Algorithms for Dispersion Problems
From MaRDI portal
Publication:4301294
DOI10.1287/opre.42.2.299zbMath0805.90074OpenAlexW1965734368MaRDI QIDQ4301294
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
dispersion problempolynomial-time algorithmmultiobjective decision makingnondominated solutionsnear-optimal solutions
Related Items (65)
Complexity of finding dense subgraphs ⋮ A new family of facet defining inequalities for the maximum edge-weighted clique problem ⋮ Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem ⋮ A comparison of \(p\)-dispersion heuristics ⋮ On the unified dispersion problem: efficient formulations and exact algorithms ⋮ A review on algorithms for maximum clique problems ⋮ The hub location and pricing problem ⋮ Facility dispersion and remote subgraphs ⋮ Iterated tabu search for the maximum diversity problem ⋮ An integer programming approach for solving the \(p\)-dispersion problem ⋮ Result diversification by multi-objective evolutionary algorithms with theoretical guarantees ⋮ Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach ⋮ \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis ⋮ An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs ⋮ A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM ⋮ Solving the anti-covering location problem using Lagrangian relaxation ⋮ Approximation algorithms for maximum dispersion ⋮ A graph-based active learning method for classification of remote sensing images ⋮ Finding connected \(k\)-subgraphs with high density ⋮ Subset selection from large datasets for kriging modeling ⋮ Approximation accuracy, gradient methods, and error bound for structured convex optimization ⋮ An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\) ⋮ Lagrangian solution of maximum dispersion problems ⋮ A two-phase tabu search based evolutionary algorithm for the maximum diversity problem ⋮ Compact location problems ⋮ Maximizing single attribute diversity in group selection ⋮ Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? ⋮ Away from each other ⋮ An exact cutting plane method for the Euclidean max-sum diversity problem ⋮ Obtaining approximately optimal and diverse solutions via dispersion ⋮ An Improved Analysis of Local Search for Max-Sum Diversification ⋮ Complexity and approximability of certain bicriteria location problems ⋮ Truthful Mechanisms for Matching and Clustering in an Ordinal World ⋮ The densest \(k\)-subgraph problem on clique graphs ⋮ A linear time approximation scheme for computing geometric maximum \(k\)-star ⋮ Algorithms for \(k\)-dispersion for points in convex position in the plane ⋮ Dispersing points on intervals ⋮ New algorithms for a simple measure of network partitioning ⋮ On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs ⋮ Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem ⋮ Efficient Approximations for the Online Dispersion Problem ⋮ Dispersing and grouping points on planar segments ⋮ Heuristic solution approaches for the maximum minsum dispersion problem ⋮ Weakly Submodular Function Maximization Using Local Submodularity Ratio. ⋮ Maximum dispersion problem in dense graphs ⋮ A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs ⋮ Discrete location problems with push-pull objectives ⋮ A Lagrangian relaxation approach to the edge-weighted clique problem ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Upper bounds and exact algorithms for \(p\)-dispersion problems ⋮ Unnamed Item ⋮ Measuring diversity. A review and an empirical analysis ⋮ An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem ⋮ New algorithms for a simple measure of network partitioning ⋮ Computational geometric aspects of rhythm, melody, and voice-leading ⋮ The maximum diversity assortment selection problem ⋮ Max-min dispersion on a line ⋮ New approximation algorithms for weighted maximin dispersion problem with box or ball constraints ⋮ The equitable dispersion problem ⋮ Integer-friendly formulations for the \(r\)-separation problem ⋮ An extended formulation approach to the edge-weighted maximal clique problem ⋮ Maximization problems of balancing submodular relevance and supermodular diversity ⋮ On solving the densestk-subgraph problem on large graphs ⋮ Approximating the maximum quadratic assignment problem ⋮ A hybrid metaheuristic method for the maximum diversity problem
This page was built for publication: Heuristic and Special Case Algorithms for Dispersion Problems
