HAL (France)
open access
Using an exact bi-objective decoder in a memetic algorithm for arc-routing (and other decoder-expressible) problems
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
- Memetic Algorithms and GPU Acceleration for Multi-Attributes Routing Problems#652765
- Hardness of Multi-Agent Path Finding on Trees: A Unified Approach#821898
- MOCHA: Multi-Objective Chebyshev Annealing for Agent Skill Optimization#204853
- Routing Coordination for X.400 MHS Services Within a Multi Protocol / Multi Network Environment Table Format V3 for Static Routing#158813
- Contextual Multi-Objective Optimization: Rethinking Objectives in Frontier AI Systems#155333
Record · ID 137624
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