IRIS
metadata only
Extended Formulations for the Electric Asymmetric TSP
The Electric Traveling Salesman Problem (ETSP) is a variant of the traditional TSP in which the vehicle is assumed to be equipped with a battery of limited capacity. Therefore, the vehicle needs to be recharged along the route and, for this purpose, a set of recharge stations is given. Each station
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
- Approximating Prize-Collecting TSP below 1.556#1061808
- Vector TSP: A Traveling Salesperson Problem with Racetrack-like acceleration constraints#1203490
- Queue-constrained packing: a vehicle ferry case study#181127
- Scale-robust Auctions#684290
- Scale-robust Auctions#682515
Record · ID 1284157
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