Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models
Year of publication: |
2000
|
---|---|
Authors: | Gabriel, Steven A. ; Bernstein, David |
Published in: |
Computational and mathematical organization theory. - Norwell, Mass. [u.a.] : Springer Science + Business Media, ISSN 1381-298X, ZDB-ID 13050801. - Vol. 6.2000, 1, p. 29-46
|
Saved in:
Saved in favorites
Similar items by person
-
The Traffic Equilibrium Problem with Nonadditive Path Costs
Gabriel, Steven A., (1997)
-
Judicial systems in transition economies : assessing the past, looking to the future
Anderson, James H., (2005)
-
Evolutionary and preferential attachment models of demand growth
Friesz, Terry L., (2009)
- More ...