A Markov chain model for traffic equilibrium problems
- 期刊名称RAIRO - Operations Research
- 作者Mastroeni, Giandomenico
- 卷第36卷
- 期第3期
- 印刷ISSN0399-0559
- 电子ISSN1290-3868
- 文件大小144.66KB
- 发表时间2002-07
- DOI10.1051/ro:2003003
- 页码209-226
On-line vertex-coveringMarc Demange; Vangelis Th. Paschos · 2005
COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSESAUSIELLO, GIORGIO; BAZGAN, CRISTINA; DEMANGE, MARC; PASCHOS, VANGELIS TH. · International Journal of Foundations of Computer Science · 2005
Approximation results for the minimum graph coloring problemMarc Demange; Pascal Grisoni; Vangelis Th. Paschos · 1994
Differential approximation algorithms for some combinatorial optimization problemsMarc Demange; Pascal Grisoni; Vangelis Th. Paschos · 1998
On-line maximum-order induced hereditary subgraph problemsMarc Demange; Xavier Paradon; Vangelis Th. Paschos · 2005
Polynomial approximation algorithms with performance guarantees: An introduction-by-exampleMarc Demange; Vangelis Th. Paschos · 2005
On an approximation measure founded on the links between optimization and polynomial approximation theoryMarc Demange; Vangelis Th. Paschos · 1996
The Dynamic Berth Allocation ProblemAhmed Simrin, ; Diabat, Ali · RAIRO - Operations Research · 2015
PrefaceMaculan, Nelson; Ridha Mahjoub, A.; Uchoa, Eduardo · RAIRO - Operations Research · 2014
Computing and proving with pivotsMeunier, Frédéric · RAIRO - Operations Research · 2013
Almost Higher Order Stochastic DominanceNiu, Cuizhen; Guo, Xu · RAIRO - Operations Research · 2014
Editorial. The MODE/ROADEF 2008 ConferenceMahey, Philippe; Quilliot, Alain · RAIRO - Operations Research · 2010
Comparison of algorithms in graph partitioningGuénoche, Alain · RAIRO - Operations Research · 2008
Locally bounded <i>k</i> -colorings of treesBentz, C.; Picouleau, C. · RAIRO - Operations Research · 2009
Articles ROADEF 2006Brotcorne, Luce; Dhaenens, Clarisse; Hanafi, Said; El-Ghazali, Talbi · RAIRO - Operations Research · 2009