arXiv (OAI Expanded)
open access
A Branch-and-Cut Algorithm for the Optimal Design of Parking Lots with One-way and Two-way Lanes
We address the problem of maximizing the number of stalls in parking lots where vehicles park perpendicular to the driveways. Building on recent research on two-way driving lanes, we first formulate a mixed integer program to maximize the number of parking stalls using a flow-based approach. Parking
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-cut-and-price algorithm for the park-and-loop routing problem#433298
- A unified vertical alignment and earthwork model in road design with a new convex optimization model for road networks#1110110
- Design Optimization of a Proposed Drainage System for a Private Educational Institution using a Detention Tank, Pervious Concrete Pavements, and Diversion Channels for Enhanced Flood Control#321277
- Beyond Scaling: Calculable Error Bounds of the Power-of-Two-Choices Mean-Field Model in Heavy-Traffic#820109
- Gradient-Enhanced Proximal Algorithms for Mean Field Planning on Surfaces#997259
Record · ID 1122928
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