The congested multicommodity network design problem
Year of publication: |
2016
|
---|---|
Authors: | Paraskevopoulos, Dimitreis C. ; Gürel, Sinan ; Bektaş, Tolga |
Published in: |
Transportation research / E : an international journal. - Amsterdam : Elsevier, ISSN 1366-5545, ZDB-ID 1380969-6. - Vol. 85.2016, p. 166-187
|
Subject: | Multi-commodity network design | Congestion | Evolutionary algorithms | Theorie | Theory | Engpass | Bottleneck | Unternehmensnetzwerk | Business network | Verkehrsstau | Traffic congestion | Netzwerk | Network |
-
Location-allocation on congested networks
Berman, Oded, (1986)
-
Optimal time-varying flows on congested networks
Carey, Malachy, (1987)
-
A note regarding prioritization on congestible networks
Raisanen, Samuel, (2015)
- More ...
-
A strong conic quadratic reformulation for machine-job assignment with controllable processing times
Aktürk, M. Selim, (2009)
-
A conic quadratic formulation for a class of convex congestion functions in network flow problems
Gürel, Sinan, (2011)
-
An anticipative scheduling approach with controllable processing times
Gürel, Sinan, (2010)
- More ...