Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem

Dulce Rosas (), Jordi Castro () and Lídia Montero ()

Computational Optimization and Applications, 2009, vol. 44, issue 2, 289-313

Keywords: Traffic assignment problem; Variational inequalities; Simplicial decomposition; Analytic center cutting plane method (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10589-007-9153-6 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:44:y:2009:i:2:p:289-313

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-007-9153-6

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().