Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem (Q1705774): Difference between revisions

@@ Property / cites work @@
+Min-cut clustering
@@ Property / cites work: Min-cut clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced graph partitioning
@@ Property / cites work: Balanced graph partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+VLSI Physical Design: From Graph Partitioning to Timing Closure
+Normal rank
@@ Property / cites work @@
+Candidate Sets for Alternative Routes in Road Networks
+Normal rank
@@ Property / cites work @@
+The partition problem
@@ Property / cites work: The partition problem / rank @@
+Normal rank
@@ Property / cites work @@
+Iterated responsive threshold search for the quadratic multiple knapsack problem
+Normal rank
@@ Property / cites work @@
+Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
+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 @@
+A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems
+Normal rank
@@ Property / cites work @@
+Lagrangean relaxation. (With comments and rejoinder).
+Normal rank
@@ Property / cites work @@
+Mersenne twister
@@ Property / cites work: Mersenne twister / rank @@
+Normal rank