HAL (France)
open access
A branch-cut-and-price algorithm for the park-and-loop routing problem
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
- A Branch-and-Cut Algorithm for the Optimal Design of Parking Lots with One-way and Two-way Lanes#1122928
- The Hiking Optimization Algorithm : a novel human-based metaheuristic approach#216113
- The Undirected m -Peripatetic Salesman Problem: Polyhedral Results and New Algorithms#676846
- Introduction to Mathematical Programming#3612
- A variable neighborhood search approach for cyclic bandwidth sum problem#243775
Record · ID 433298
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