Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
type: Item
instance of: scholarly article
title: Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
zbMATH Open document ID: 1180.90058
author: Dulce Rosas
author: Jordi Castro
author: Lídia Montero
published in: Computational Optimization and Applications
publication date: 2010-02-24T00:00:00Z
Mathematics Subject Classification ID: 90B20
zbMATH DE Number: 5674553
zbMATH Keywords: traffic assignment problem
zbMATH Keywords: variational inequalities
zbMATH Keywords: simplicial decomposition
zbMATH Keywords: analytic center cutting plane method
MaRDI profile type: Publication
full work available at URL: s10589-007-9153-6
OpenAlex ID: W2102766970
cites work: Origin-Based Algorithm for the Traffic Assignment Problem
cites work: Projection methods for variational inequalities with application to the traffic assignment problem
cites work: On a primal-dual analytic center cutting plane method for variational inequalities
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Nonlinear cost network models in transportation analysis
cites work: A relaxed projection method for variational inequalities
cites work: Q3775301
cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm
cites work: Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
cites work: An analytic center cutting plane method for pseudomonotone variational inequalities
cites work: Using an interior point method for the master problem in a decomposition approach
cites work: Restricted simplicial decomposition: Computation and extensions
cites work: INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
cites work: Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
cites work: Adaptation of a Modified Newton Method for Solving the Asymmetric Traffic Equilibrium Problem
cites work: On the generalization of a direct method of the calculus of variations
cites work: A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network
cites work: Q4324980
cites work: Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities
cites work: On the convergence of descent methods for monotone variational inequalities
cites work: Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs
cites work: Modified Projection-Type Methods for Monotone Variational Inequalities
DOI: 10.1007/S10589-007-9153-6
description: scientific article; zbMATH DE number 5674553