Heuristic and Special Case Algorithms for Dispersion Problems

DOI10.1287/opre.42.2.299zbMath0805.90074MaRDI 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

zbMATH Keywords

dispersion problem; polynomial-time algorithm; multiobjective decision making; nondominated solutions; near-optimal solutions

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B80: Discrete location and assignment

Related Items

Unnamed Item, Maximum dispersion problem in dense graphs, A Lagrangian relaxation approach to the edge-weighted clique problem, Discrete location problems with push-pull objectives, 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, 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, An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\), Iterated tabu search for the maximum diversity problem, 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