scientific article; zbMATH DE number 177561

MaRDI QIDQ4037432zbMATH OpenFDO

Authors S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi

Publication date 18 May 1993

zbMATH Keywords

dispersion problemheuristicMAX-AVGMAX-MinNP-hardtriangle inequality

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Heuristic and Special Case Algorithms for Dispersion Problems
• Upper bounds and exact algorithms for \(p\)-dispersion problems
• The discrete p-dispersion problem
• Facility dispersion and remote subgraphs
• scientific article; zbMATH DE number 849075

Cited in

(35)

• A heuristic approach for the max-min diversity problem based on max-clique
• Integer-friendly formulations for the \(r\)-separation problem
• A comparison of \(p\)-dispersion heuristics
• \(k\)-edge subgraph problems
• Minimum dispersion problems
• Compact location problems
• Dispersing points on intervals
• Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs
• Facility dispersion problems under capacity and cost constraints
• Max-Min 3-Dispersion problems
• 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
• scientific article; zbMATH DE number 1670536 (Why is no real title available?)
• The p-neighbor k-center problem
• An Analysis of Network Location Problems with Distance Constraints
• Comparison Of Four Models For dispersing Facilities
• Representation of the non-dominated set in biobjective discrete optimization
• Approximation with a fixed number of solutions of some multiobjective maximization problems
• scientific article; zbMATH DE number 1253046 (Why is no real title available?)
• Heuristic and Special Case Algorithms for Dispersion Problems
• Maximal Spacing Configurations in Graphs
• Sequential Design of Experiment for Sparse Polynomial Chaos Expansions
• scientific article; zbMATH DE number 849075 (Why is no real title available?)
• scientific article; zbMATH DE number 913711 (Why is no real title available?)
• Facility dispersion and remote subgraphs
• Greedily finding a dense subgraph
• Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
• Obtaining online approximation algorithms for facility dispersion from offline algorithms
• Max-min dispersion on a line
• Max-min dispersion on a line
• Approximation of geometric dispersion problems
• Compact location problems with budget and communication constraints
• An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane
• The discrete p-dispersion problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037432)