arXiv (All)
open access
Single-level reformulations for network pricing under Wardrop equilibrium with separable affine costs
We consider the problem of setting tolls on a subset of the arcs of a congested network so as to maximize the revenue of a network authority, anticipating that users route according to a Wardrop equilibrium. This problem is naturally cast as a bilevel program in which the leader sets tolls while the
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
- Fair and Efficient Investment in Public Transportation#1156272
- A branch-cut-and-price algorithm for the park-and-loop routing problem#433298
- Representing the Non-dominated Set of Multi-objective Optimization Problems with Polyhedral Ordering Cones#1297493
- Contributions to workload equity for Vehicles Routing Problems#144888
- Primal-dual forward-reflected splitting with linesearch for distributed min-max problems under local Lipschitz smoothness#1387787
Record · ID 1401127
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