HAL (France)
open access
Hybrid genetic algorithm for undirected traveling salesman problems with profits
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
- Improved Discrete Queuing Search Algorithm for Traveling Salesman Problem#1149057
- An intensification-driven search algorithm for the family traveling salesman problem with incompatibility constraints#231603
- The Undirected m -Peripatetic Salesman Problem: Polyhedral Results and New Algorithms#676846
- New algorithmic methods for real-time transportation problems#454317
- The Salesman#46337
Record · ID 235300
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