Aperta
metadata only
CC BY 4.0
Improved Discrete Queuing Search Algorithm for Traveling Salesman Problem
The traveling salesman problem (TSP) is a well-known NP-hard discrete combinatorial optimization problem, and exact approaches such as branch-and-bound, cutting planes and dynamic programming become ineffective as the number of nodes grows. This chapte
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
- Hybrid genetic algorithm for undirected traveling salesman problems with profits#235300
- Extending Exact Integrality Gap Computations for the Metric TSP#986210
- New algorithmic methods for real-time transportation problems#454317
- The Undirected m -Peripatetic Salesman Problem: Polyhedral Results and New Algorithms#676846
- A reinforcement learning-enhanced discrete zebra optimization algorithm for solving the traveling salesman problem.#610417
Record · ID 1149057
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