Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032): Difference between revisions

@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2004.09.033
+Normal rank
@@ Property / OpenAlex ID @@
+W2064370739
@@ Property / OpenAlex ID: W2064370739 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q58826447
@@ Property / Wikidata QID: Q58826447 / rank @@
+Normal rank
@@ Property / cites work @@
+Greedily Finding a Dense Subgraph
@@ Property / cites work: Greedily Finding a Dense Subgraph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4867320
@@ Property / cites work: Q4867320 / rank @@
+Normal rank
@@ Property / cites work @@
+The discrete p-dispersion problem
@@ Property / cites work: The discrete p-dispersion problem / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic and Special Case Algorithms for Dispersion Problems
+Normal rank
@@ Property / cites work @@
+Q4400856
@@ Property / cites work: Q4400856 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for maximum dispersion
@@ Property / cites work: Approximation algorithms for maximum dispersion / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering and domination in perfect graphs
@@ Property / cites work: Clustering and domination in perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Good solutions to discrete noxious location problems via metaheuristics
+Normal rank
@@ Property / cites work @@
+A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem
+Normal rank
@@ Property / cites work @@
+Roof duality, complementation and persistency in quadratic 0–1 optimization
+Normal rank
@@ Property / cites work @@
+Complexity of finding dense subgraphs
@@ Property / cites work: Complexity of finding dense subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Lagrangean methods for the 0-1 quadratic knapsack problem
+Normal rank
@@ Property / cites work @@
+Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
+Normal rank
@@ Property / cites work @@
+A new upper bound for the 0-1 quadratic knapsack problem
+Normal rank
@@ Property / cites work @@
+Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
+Normal rank
@@ Property / cites work @@
+Exact Solution of the Quadratic Knapsack Problem
@@ Property / cites work: Exact Solution of the Quadratic Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Discrete location problems with push-pull objectives
+Normal rank
@@ Property / cites work @@
+Quadratic knapsack problems
@@ Property / cites work: Quadratic knapsack problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4321552
@@ Property / cites work: Q4321552 / rank @@
+Normal rank
@@ Property / cites work @@
+The traveling-salesman problem and minimum spanning trees: Part II
+Normal rank
@@ Property / cites work @@
+Q3835301
@@ Property / cites work: Q3835301 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4178782
@@ Property / cites work: Q4178782 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4058442
@@ Property / cites work: Q4058442 / rank @@
+Normal rank
@@ Property / cites work @@
+Quadratic knapsack relaxations using cutting planes and semidefinite programming
+Normal rank
@@ Property / cites work @@
+A semidefinite programming approach to the quadratic knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear programming for the \(0-1\) quadratic knapsack problem
+Normal rank
@@ Property / cites work @@
+An exact algorithm for large multiple knapsack problems
+Normal rank