Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities (Q1887951): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q59297280, #quickstatements; #temporary_batch_1703698927563 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59297280 / rank | |||
Normal rank | |||
Revision as of 19:48, 27 December 2023
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
