Pages that link to "Item:Q4408707"
From MaRDI portal
The following pages link to Origin-Based Algorithm for the Traffic Assignment Problem (Q4408707):
Displayed 36 items.
- A branch and bound algorithm for bi-level discrete network design problem (Q264253) (← links)
- A framework for and empirical study of algorithms for traffic assignment (Q337346) (← links)
- A semismooth Newton method for traffic equilibrium problem with a general nonadditive route cost (Q636547) (← links)
- An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem (Q652866) (← links)
- Traffic equilibrium and charging facility locations for electric vehicles (Q681451) (← links)
- User equilibrium with recourse (Q844138) (← links)
- Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem (Q849087) (← links)
- A comparison of feasible direction methods for the stochastic transportation problem (Q989847) (← links)
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems (Q1016355) (← links)
- Algorithms for distributing traffic flows (Q1042690) (← links)
- Breakdown minimization principle versus Wardrop's equilibria for dynamic traffic assignment and control in traffic and transportation networks: a critical mini-review (Q1620203) (← links)
- A computational study of path-based methods for optimal traffic assignment with both inelastic and elastic demand (Q1634068) (← links)
- Estimating the capacity of urban transportation networks with an improved sensitivity based method (Q1723533) (← links)
- Robust optimization in the presence of uncertainty: a generic approach (Q1745727) (← links)
- Non-additive shortest path in the context of traffic assignment (Q1754328) (← links)
- An \(N\)-path user equilibrium for transportation networks (Q1991373) (← links)
- Refugee migration networks and regulations: a multiclass, multipath variational inequality framework (Q2022184) (← links)
- A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models (Q2029917) (← links)
- Finding flow equilibrium with projective methods with decomposition and route generation (Q2261748) (← links)
- A modified \textit{Physarum}-inspired model for the user equilibrium traffic assignment problem (Q2295145) (← links)
- Primal convergence from dual subgradient methods for convex optimization (Q2340335) (← links)
- On the convergence of inexact block coordinate descent methods for constrained optimization (Q2356093) (← links)
- Path flow estimator in an entropy model using a nonlinear L-shaped algorithm (Q2358123) (← links)
- An improved origin-based algorithm for solving the combined distribution and assignment problem (Q2470100) (← links)
- A convergent and efficient decomposition method for the traffic assignment problem (Q2515069) (← links)
- Forecasting travel on congested urban transportation networks: Review and prospects for network equilibrium models (Q2642505) (← links)
- Modifying link capacity to avoid Braess paradox considering elastic demand (Q2675881) (← links)
- Numerical stability of path-based algorithms for traffic assignment (Q2811480) (← links)
- A mean-variance model for the minimum cost flow problem with stochastic arc costs (Q3057183) (← links)
- A convergent and fast path equilibration algorithm for the traffic assignment problem (Q4638926) (← links)
- Fragile networks: identifying vulnerabilities and synergies in an uncertain age (Q4918253) (← links)
- Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) (← links)
- Braess' paradox: A cooperative game‐theoretic point of view (Q6065828) (← links)
- Telecommunications network design: Technology impacts and future directions (Q6087074) (← links)
- An alternating direction method of multipliers for solving user equilibrium problem (Q6113451) (← links)
- A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem (Q6164562) (← links)