Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities (Q1887951): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(03)00423-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029875167 / rank | |||
Normal rank | |||
Latest revision as of 09:24, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities |
scientific article |
Statements
Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities (English)
0 references
22 November 2004
0 references
Variational inequalities
0 references
Co-coercivity
0 references
Traffic assignment
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
