A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / 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 @@
+6650852
@@ Property / zbMATH DE Number: 6650852 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+optimization
@@ Property / zbMATH Keywords: optimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+combinatorial optimization
@@ Property / zbMATH Keywords: combinatorial optimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+networks
@@ Property / zbMATH Keywords: networks / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graphs
@@ Property / zbMATH Keywords: graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+trees
@@ Property / zbMATH Keywords: trees / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+spanning trees
@@ Property / zbMATH Keywords: spanning trees / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+capacitated minimum spanning tree
@@ Property / zbMATH Keywords: capacitated minimum spanning tree / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+heuristics
@@ Property / zbMATH Keywords: heuristics / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+biased random-key genetic algorithm
@@ Property / zbMATH Keywords: biased random-key genetic algorithm / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Tabu search
@@ Property / describes a project that uses: Tabu search / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2008778291
@@ Property / OpenAlex ID: W2008778291 / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
+Normal rank
@@ Property / cites work @@
+Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
+Normal rank
@@ Property / cites work @@
+Genetic Algorithms and Random Keys for Sequencing and Optimization
+Normal rank
@@ Property / cites work @@
+A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
+Normal rank
@@ Property / cites work @@
+A biased random-key genetic algorithm for road congestion minimization
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Some Postman Problems
+Normal rank
@@ Property / cites work @@
+Topological design of centralized computer networks—formulations and algorithms
+Normal rank
@@ Property / cites work @@
+Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
+Normal rank
@@ Property / cites work @@
+Q4354785
@@ Property / cites work: Q4354785 / rank @@
+Normal rank
@@ Property / cites work @@
+A parallel multi-population biased random-key genetic algorithm for a container loading problem
+Normal rank
@@ Property / cites work @@
+A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Multicommodity flow models for spanning trees with hop constraints
+Normal rank
@@ Property / cites work @@
+Multistars and directed flow formulations
@@ Property / cites work: Multistars and directed flow formulations / rank @@
+Normal rank
@@ Property / cites work @@
+The capacitated minimum spanning tree problem: On improved multistar constraints
+Normal rank
@@ Property / cites work @@
+Q4944737
@@ Property / cites work: Q4944737 / rank @@
+Normal rank
@@ Property / cites work @@
+The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
+Normal rank
@@ Property / cites work @@
+Dynamic programming based heuristics for the topological design of local access networks
+Normal rank
@@ Property / cites work @@
+Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+A random key based genetic algorithm for the resource constrained project scheduling problem
+Normal rank
@@ Property / cites work @@
+Q5818007
@@ Property / cites work: Q5818007 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the capacitated tree problem
@@ Property / cites work: The complexity of the capacitated tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+RAMP for the capacitated minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Savings based ant colony optimization for the capacitated minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
+Normal rank
@@ Property / cites work @@
+A biased random-key genetic algorithm for the Steiner triple covering problem
+Normal rank
@@ Property / cites work @@
+Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
+Normal rank
@@ Property / cites work @@
+A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:337493