Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
From MaRDI portal
Publication:849087
DOI10.1007/s10589-007-9153-6zbMath1180.90058OpenAlexW2102766970MaRDI QIDQ849087
Lídia Montero, Dulce Rosas, Jordi Castro
Publication date: 24 February 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9153-6
variational inequalitiessimplicial decompositiontraffic assignment problemanalytic center cutting plane method
Related Items (3)
Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem ⋮ Column generation algorithms for nonlinear optimization. II: Numerical investigations ⋮ ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
Cites Work
- Unnamed Item
- Unnamed Item
- Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
- Using an interior point method for the master problem in a decomposition approach
- On a primal-dual analytic center cutting plane method for variational inequalities
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network
- An analytic center cutting plane method for pseudomonotone variational inequalities
- On the convergence of descent methods for monotone variational inequalities
- A relaxed projection method for variational inequalities
- Nonlinear cost network models in transportation analysis
- Restricted simplicial decomposition: Computation and extensions
- Adaptation of a Modified Newton Method for Solving the Asymmetric Traffic Equilibrium Problem
- INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
- Projection methods for variational inequalities with application to the traffic assignment problem
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs
- Origin-Based Algorithm for the Traffic Assignment Problem
- Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities
- Modified Projection-Type Methods for Monotone Variational Inequalities
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- On the generalization of a direct method of the calculus of variations
This page was built for publication: Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
