UM Research Repository
metadata only
A genetic algorithm solution to the shortest path problem in OSPF and MPLS
This project studies and explores the potential of using genetic algorithm to solve the shortest path problem in Open Shortest Path First (OSPF) and Multiprotocol Label Switching (MPLS). The most critical task for developing a genetic algorithm to the shortest path problem is to how to encode a path
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Prescribing the Right Agent for Depression in Adults (PRADA): a Double-blind, Randomised Controlled Trial Using a Web-based Multi-modal Clinical Decision Support System and Genetic Information to Personalise Antidepressant Treatment in Diverse Clinical Settings Across the Globe#1087999
- Multi-Topology (MT) Routing in OSPF#254530
- From Procedural Skills to Strategy Genes: Towards Experience-Driven Test-Time Evolution#1014669
- Automatically Switched Optical Network (ASON) Routing for OSPFv2 Protocols#220712
- FlowATC: Aircraft Trajectory Prediction via Flow Matching#1122557
Record · ID 1193828
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive