A heuristic method for solving the problem of partitioning graphs with supply and demand (Q256649): Difference between revisions

@@ Property / DOI @@
-.1007/s10479-015-1930-5
@@ Property / DOI: 10.1007/s10479-015-1930-5 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C59
@@ Property / Mathematics Subject Classification ID: 90C59 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6553004
@@ Property / zbMATH DE Number: 6553004 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph partitioning
@@ Property / zbMATH Keywords: graph partitioning / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+greedy algorithm
@@ Property / zbMATH Keywords: greedy algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+demand node
@@ Property / zbMATH Keywords: demand node / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+supply node
@@ Property / zbMATH Keywords: supply node / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1558032106
@@ Property / OpenAlex ID: W1558032106 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.1080
@@ Property / arXiv ID: 1411.1080 / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced graph partitioning
@@ Property / cites work: Balanced graph partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+A New Heuristic for Partitioning the Nodes of a Graph
+Normal rank
@@ Property / cites work @@
+A Method for Solving Traveling-Salesman Problems
@@ Property / cites work: A Method for Solving Traveling-Salesman Problems / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient memetic algorithm for the graph partitioning problem
+Normal rank
@@ Property / cites work @@
+PARTITIONING TREES OF SUPPLY AND DEMAND
@@ Property / cites work: PARTITIONING TREES OF SUPPLY AND DEMAND / rank @@
+Normal rank
@@ Property / cites work @@
+Approximability of partitioning graphs with supply and demand
+Normal rank
@@ Property / cites work @@
+Minimum cost partitions of trees with supply and demand
+Normal rank
@@ Property / cites work @@
+Lock-gain based graph partitioning
@@ Property / cites work: Lock-gain based graph partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Heuristic Procedure for Partitioning Graphs
+Normal rank
@@ Property / cites work @@
+A bionomic approach to the capacitated \(p\)-median problem
+Normal rank
@@ Property / cites work @@
+Expanding neighborhood GRASP for the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Parametric Power Supply Networks
@@ Property / cites work: Parametric Power Supply Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Tree \(t\)-spanners in outerplanar graphs via supply demand partition
+Normal rank
@@ Property / cites work @@
+Modelling the Power Supply Network – Hardness and Approximation
+Normal rank
@@ Property / cites work @@
+Generating partitions of a graph into a fixed number of minimum weight cuts
+Normal rank
@@ Property / cites work @@
+Computing finest mincut partitions of a graph and application to routing problems
+Normal rank
@@ Property / cites work @@
+A scatter search heuristic for the capacitated clustering problem
+Normal rank
@@ Property / DOI @@
+.1007/S10479-015-1930-5
@@ Property / DOI: 10.1007/S10479-015-1930-5 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:256649