scientific article; zbMATH DE number 966589
From MaRDI portal
Publication:5689980
Recommendations
- Approximation of the steepest descent direction for the O-D matrix adjustment problem
- scientific article; zbMATH DE number 5176444
- A coordinate descent method for total variation minimization
- A flexible coordinate descent method
- Alternating direction method for bi-quadratic programming
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
- A block-coordinate descent method for linearly constrained minimization problem
- Rescaled coordinate descent methods for linear programming
- Dual randomized coordinate descent method for solving a class of nonconvex problems
- Global optimization for the biaffine matrix inequality problem
Cited in
(11)- Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions.
- Enhanced least square based dynamic OD matrix estimation using radio frequency identification data
- Origin-destination matrix estimation problem in a Markov chain approach
- A fuzzy set-based approach to origin-destination matrix estimation in urban traffic networks with imprecise data
- New algorithmic alternatives for the O--D matrix adjustment problem on traffic networks
- An overview of bilevel optimization
- A heuristic for the OD matrix adjustment problem in a congested transport network
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Quantifying the benefits of customized vaccination strategies: A network‐based optimization approach
- Approximation of the steepest descent direction for the O-D matrix adjustment problem
- Transit passenger origin-destination estimation in congested transit networks with elastic line frequencies
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5689980)
