A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks (Q360513): Difference between revisions

@@ 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 / Mathematics Subject Classification ID @@
+B18
@@ Property / Mathematics Subject Classification ID: 90B18 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6201765
@@ Property / zbMATH DE Number: 6201765 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+multi-population
@@ Property / zbMATH Keywords: multi-population / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+genetic algorithms
@@ Property / zbMATH Keywords: genetic algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+local search
@@ Property / zbMATH Keywords: local search / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+network flows
@@ Property / zbMATH Keywords: network flows / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+hop-constrained trees
@@ Property / zbMATH Keywords: hop-constrained trees / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+general nonlinear costs
@@ Property / zbMATH Keywords: general nonlinear costs / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+OR-Library
@@ Property / describes a project that uses: OR-Library / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2054006251
@@ Property / OpenAlex ID: W2054006251 / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Large-Scale Network Topological Optimization
@@ Property / cites work: Large-Scale Network Topological Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5294063
@@ Property / cites work: Q5294063 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic solutions for general concave minimum cost network flow problems
+Normal rank
@@ Property / cites work @@
+Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
+Normal rank
@@ Property / cites work @@
+A branch-and-bound algorithm for concave network flow problems
+Normal rank
@@ Property / cites work @@
+A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
+Normal rank
@@ Property / cites work @@
+Adjacent extreme flows and application to min concave cost flow problems
+Normal rank
@@ Property / cites work @@
+Network design techniques using adapted genetic algorithms
+Normal rank
@@ Property / cites work @@
+A genetic algorithm for the resource constrained multi-project scheduling problem
+Normal rank
@@ Property / cites work @@
+A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
+Normal rank
@@ Property / cites work @@
+A hybrid genetic algorithm for the job shop scheduling problem
+Normal rank
@@ Property / cites work @@
+A parallel multi-population biased random-key genetic algorithm for a container loading problem
+Normal rank
@@ Property / cites work @@
+Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
+Normal rank
@@ Property / cites work @@
+Multicommodity flow models for spanning trees with hop constraints
+Normal rank
@@ Property / cites work @@
+The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
+Normal rank
@@ Property / cites work @@
+A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Q4079017
@@ Property / cites work: Q4079017 / rank @@
+Normal rank
@@ Property / cites work @@
+A hop constrained min-sum arborescence with outage costs
+Normal rank
@@ Property / cites work @@
+Packet reordering in networks with heavy-tailed delays
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
+Normal rank
@@ Property / cites work @@
+Bilinear modeling solution approach for fixed charge network flow problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:360513