| Simplicial decomposition with disaggregated representation for the traffic assignment problem T Larsson, M Patriksson Transportation Science 26 (1), 4, 1992 | 381 | 1992 |
| An augmented Lagrangean scheme for capacitated traffic assignment problems T Larsson, M Patriksson Proceedings of the Second Meeting of the EURO Working Group on Urban Traffic …, 1994 | 271* | 1994 |
| Side constrained traffic equilibrium models—analysis, computation and applications T Larsson, M Patriksson Transportation Research Part B: Methodological 33 (4), 233-264, 1999 | 208 | 1999 |
| Ergodic, primal convergence in dual subgradient schemes for convex programming T Larsson, M Patriksson, AB Strömberg Mathematical programming 86, 283-312, 1999 | 164 | 1999 |
| A class of gap functions for variational inequalities T Larsson, M Patriksson Mathematical Programming 64, 53-79, 1994 | 151 | 1994 |
| Conditional subgradient optimization—Theory and applications T Larsson, M Patriksson, AB Stromberg European Journal of Operational Research 88 (2), 382-403, 1996 | 119 | 1996 |
| Automating the self-scheduling process of nurses in Swedish healthcare: a pilot study E Rönnberg, T Larsson Health care management science 13, 35-53, 2010 | 116 | 2010 |
| Side constrained traffic equilibrium models—traffic management through link tolls T Larsson, M Patriksson Equilibrium and Advanced Transportation Modeling, 125-151, 1998 | 95 | 1998 |
| Equilibrium characterizations of solutions to side constrained asymmetric traffic assignment models M Patriksson, T Larsson Le Matematiche 49 (2), 249-280, 1994 | 73 | 1994 |
| An augmented lagrangian algorithm for large scale multicommodity routing T Larsson, D Yuan Computational Optimization and Applications 27, 187-215, 2004 | 68 | 2004 |
| A Benders decomposition based heuristic for the hierarchical production planning problem K Aardal, T Larsson European Journal of Operational Research 45 (1), 4-14, 1990 | 68 | 1990 |
| A Lagrangean relaxation scheme for structured linear programs with application to multicommodity network flows T Larsson, Z Liu Optimization 40 (3), 247-284, 1997 | 63* | 1997 |
| Allocation of link flow detectors for origin‐destination matrix estimation—A comparative study T Larsson, JT Lundgren, A Peterson Computer‐Aided Civil and Infrastructure Engineering 25 (2), 116-131, 2010 | 55 | 2010 |
| Most likely traffic equilibrium route flows analysis and computation T Larsson, JT Lundgren, C Rydergren, M Patriksson Equilibrium Problems: Nonsmooth Optimization and Variational Inequality …, 2001 | 54 | 2001 |
| Sequential quadratic programming for non‐linear elastic contact problems G Björkman, A Klarbring, B Sjödin, T Larsson, M Rönnqvist International journal for numerical methods in engineering 38 (1), 137-165, 1995 | 53 | 1995 |
| A Lagrangean heuristic for the capacitated concave minimum cost network flow problem T Larsson, A Migdalas, M Rönnqvist European journal of operational research 78 (1), 116-129, 1994 | 53 | 1994 |
| Lagrangian relaxation via ballstep subgradient methods KC Kiwiel, T Larsson, PO Lindberg Mathematics of Operations Research 32 (3), 669-686, 2007 | 51 | 2007 |
| On traffic equilibrium models with a nonlinear time/money relation T Larsson, PO Lindberg, M Patriksson, C Rydergren Transportation Planning, Proceedings of the 6th Meeting of the EURO Working …, 2004 | 51 | 2004 |
| On the convergence of conditional-subgradient methods for convex programs and convex-concave saddle-point problems T Larsson, M Patriksson, AB Stromberg European Journal of Operational Research 151 (3), 461-473, 2003 | 48 | 2003 |
| A column generation procedure for the side constrained traffic equilibrium problem T Larsson, M Patriksson, C Rydergren Transportation Research Part B: Methodological 38 (1), 17-38, 2004 | 47 | 2004 |
Michael PatrikssonProfessor of applied mathematics, Chalmers University of Technologychalmers.se의 이메일 확인됨
