Narrow search
Showing 31 - 40 of 636,181
Cover Image
A least-squares minimum-cost network flow algorithm
Gopalakrishnan, Balaji; Kong, Seunghyun; Barnes, Earl; … - 2011
Persistent link: https://www.econbiz.de/10009243389
Cover Image
The time constrained multi-commodity network flow problem and its application to liner shipping network design
Karsten, Christian Vad; Pisinger, David; Ropke, Stefan; … - In: Transportation research / E : an international journal 76 (2015), pp. 122-138
Persistent link: https://www.econbiz.de/10010518606
Cover Image
Branch-and-price guided search for integer programs with an application to the multicommodity fixed-charge network flow problem
Hewitt, Mike; Nemhauser, George L.; Savelsbergh, Martin … - In: INFORMS journal on computing : JOC 25 (2013) 2, pp. 302-316
Persistent link: https://www.econbiz.de/10009753753
Cover Image
Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price
Zhu, Xiaoyan; Wilhelm, Wilbert E. - In: Computers & operations research : and their … 40 (2013) 1, pp. 385-394
Persistent link: https://www.econbiz.de/10009658507
Cover Image
On the K best integer network flows
Sedeño-Noda, Antonio; Espino-Martín, Juan José - In: Computers & operations research : and their … 40 (2013) 2, pp. 616-626
Persistent link: https://www.econbiz.de/10009661144
Cover Image
Optimizing network flows with congestion-based flow reductions
Bish, Douglas R.; Chamberlayne, Edward P.; Rakha, Hesham A. - In: Networks and spatial economics : a journal of … 13 (2013) 3, pp. 283-306
Persistent link: https://www.econbiz.de/10010226850
Cover Image
On finding representative non-dominanted points for bi-objective integer network flow problems
Eusébio, Augusto; Figueira, José Rui; Ehrgott, Matthias - In: Computers & operations research : and their … 48 (2014), pp. 1-10
Persistent link: https://www.econbiz.de/10010376422
Cover Image
Strategic path reliability in information networks
Kannan, Rajgopal; Sarangi, Sudipta; Iyengar, Sundaraja … - 2002
We consider a model of an information network where nodes can fail and transmission of information is costly. The formation of paths in such networks is modeled as the Nash equilibrium of an N player routing game. The task of obtaining this equilibrium is shown to be NP-Hard. We derive...
Persistent link: https://www.econbiz.de/10011436398
Cover Image
Parametric approximation formulas for the distributions of cost functionals in spatial stochastic networks
Neuhäuser, David - 2015
Persistent link: https://www.econbiz.de/10011442706
Cover Image
The constrained shortest path tour problem
Ferone, Daniele; Guerriero, Francesca; Laganè, Demetrio - In: Computers & operations research : and their … 74 (2016), pp. 64-77
Persistent link: https://www.econbiz.de/10011514162