Michael Patriksson

Publication Activity (10 Years)

Years Active: 1992-2020
Publications (10 Years): 11

Top Topics

Convex Programming

Benders Decomposition

Optimization Methods

Preventive Maintenance

Top Venues

Ann. Oper. Res.

Comput. Aided Civ. Infrastructure Eng.

Comput. Ind. Eng.

Publications

Mahdieh Rezaei, Mohsen Afsahi, Mahmood Shafiee, Michael Patriksson
A bi-objective optimization framework for designing an efficient fuel supply chain network in post-earthquakes. Comput. Ind. Eng. 147 (2020)
Efraim Laksman, Ann-Brith Strömberg, Michael Patriksson
The stochastic opportunistic replacement problem, part III: improved bounding procedures. Ann. Oper. Res. 292 (2) (2020)
Saeed Asadi Bagloee, Madjid Tavana, Glenn Withers, Michael Patriksson, Mohsen Asadi
Tradable mobility permit with Bitcoin and Ethereum - A Blockchain application in transportation. Internet Things 8 (2019)
Saeed Asadi Bagloee, Mohsen Asadi, Michael Patriksson
Minimization of water pumps' electricity usage: A hybrid approach of regression models with optimization. Expert Syst. Appl. 107 (2018)
Saeed Asadi Bagloee, Mohsen Asadi, Majid Sarvi, Michael Patriksson
A hybrid machine-learning and optimization method to solve bi-level problems. Expert Syst. Appl. 95 (2018)
Zuzana Nedelková, Peter Lindroth, Michael Patriksson, Ann-Brith Strömberg
Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space. Ann. Oper. Res. 265 (1) (2018)
Saeed Asadi Bagloee, Majid Sarvi, Michael Patriksson, Mohsen Asadi
Optimization for Roads' Construction: Selection, Prioritization, and Scheduling. Comput. Aided Civ. Infrastructure Eng. 33 (10) (2018)
Saeed Asadi Bagloee, Majid Sarvi, Michael Patriksson
A Hybrid Branch-and-Bound and Benders Decomposition Algorithm for the Network Design Problem. Comput. Aided Civ. Infrastructure Eng. 32 (4) (2017)
Saeed Asadi Bagloee, Majid Sarvi, Michael Patriksson, Abbas Rajabifard
A Mixed User-Equilibrium and System-Optimal Traffic Flow for Connected Vehicles Stated as a Complementarity Problem. Comput. Aided Civ. Infrastructure Eng. 32 (7) (2017)
Magnus Önnheim, Emil Gustavsson, Ann-Brith Strömberg, Michael Patriksson, Torbjörn Larsson
Ergodic, primal convergence in dual subgradient schemes for convex programming, II: the case of inconsistent primal problems. Math. Program. 163 (1-2) (2017)
Torbjörn Larsson, Michael Patriksson
"Subben's checklist" and the assessment of articles in mathematical optimization/operations research: In memoriam of Subhash C. Narula. Comput. Oper. Res. 71 (2016)
Michael Patriksson, Ann-Brith Strömberg, Adam Wojciechowski
The stochastic opportunistic replacement problem, part II: a two-stage solution approach. Ann. Oper. Res. 224 (1) (2015)
Emil Gustavsson, Michael Patriksson, Ann-Brith Strömberg
Primal convergence from dual subgradient methods for convex optimization. Math. Program. 150 (2) (2015)
Michael Patriksson, Ann-Brith Strömberg, Adam Wojciechowski
The stochastic opportunistic replacement problem, part I: models incorporating individual component lives. Ann. Oper. Res. 224 (1) (2015)
Torbjörn Larsson, Athanasios Migdalas, Michael Patriksson
A generic column generation principle: derivation and convergence analysis. Oper. Res. 15 (2) (2015)
Michael Patriksson, Christoffer Strömberg
Algorithms for the continuous nonlinear resource allocation problem - New implementations and numerical studies. Eur. J. Oper. Res. 243 (3) (2015)
Emil Gustavsson, Michael Patriksson, Ann-Brith Strömberg, Adam Wojciechowski, Magnus Önnheim
Preventive maintenance scheduling of multi-component systems with interval costs. Comput. Ind. Eng. 76 (2014)
Mahmood Shafiee, Michael Patriksson, Ann-Brith Strömberg
An Optimal Number-Dependent Preventive Maintenance Strategy for Offshore Wind Turbine Blades Considering Logistics. Adv. Oper. Res. 2013 (2013)
Torgny Almgren, Niclas Andréasson, Michael Patriksson, Ann-Brith Strömberg, Adam Wojciechowski, Magnus Önnheim
The opportunistic replacement problem: theoretical analyses and numerical tests. Math. Methods Oper. Res. 76 (3) (2012)
Ricardo García-Ródenas, Ángel Marín, Michael Patriksson
Column generation algorithms for nonlinear optimization, II: Numerical investigations. Comput. Oper. Res. 38 (3) (2011)
Karin Thörnblad, Michael Patriksson
A note on the complexity of flow-shop scheduling with deteriorating jobs. Discret. Appl. Math. 159 (4) (2011)
Peter Lindroth, Michael Patriksson, Ann-Brith Strömberg
Approximating the Pareto optimal set using a reduced set of objective functions. Eur. J. Oper. Res. 207 (3) (2010)
Maria Daneva, Torbjörn Larsson, Michael Patriksson, Clas Rydergren
A comparison of feasible direction methods for the stochastic transportation problem. Comput. Optim. Appl. 46 (3) (2010)
Torbjörn Larsson, Johan Marklund, Caroline Olsson, Michael Patriksson
Convergent Lagrangian heuristics for nonlinear minimum cost network flows. Eur. J. Oper. Res. 189 (2) (2008)
Michael Patriksson
A survey on the continuous nonlinear resource allocation problem. Eur. J. Oper. Res. 185 (1) (2008)
Torbjörn Larsson, Michael Patriksson
Global Optimality Conditions for Discrete and Nonconvex Optimization - With Applications to Lagrangian Heuristics and Column Generation. Oper. Res. 54 (3) (2006)
Michael Patriksson
Sensitivity Analysis of Traffic Equilibria. Transp. Sci. 38 (3) (2004)
Torbjörn Larsson, Michael Patriksson, Ann-Brith Strömberg
On the convergence of conditional epsilon-subgradient methods for convex programs and convex-concave saddle-point problems. Eur. J. Oper. Res. 151 (3) (2003)
Michael Patriksson, R. Tyrrell Rockafellar
Sensitivity Analysis of Aggregated Variational Inequality Problems, with Application to Traffic Equilibria. Transp. Sci. 37 (1) (2003)
Torbjörn Larsson, Michael Patriksson, Clas Rydergren
Inverse nonlinear multicommodity flow optimization by column generation. Optim. Methods Softw. 18 (5) (2003)
Michael Patriksson, R. Tyrrell Rockafellar
A Mathematical Model and Descent Algorithm for Bilevel Traffic Management. Transp. Sci. 36 (3) (2002)
Michael Patriksson, Laura Wynter
Stochastic mathematical programs with equilibrium constraints. Oper. Res. Lett. 25 (4) (1999)
Torbjörn Larsson, Michael Patriksson, Ann-Brith Strömberg
Ergodic, primal convergence in dual subgradient schemes for convex programming. Math. Program. 86 (2) (1999)
Michael Patriksson
Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs. SIAM J. Optim. 8 (2) (1998)
Michael Patriksson
Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets. Comput. Optim. Appl. 9 (1) (1998)
Jan T. Lundgren, Michael Patriksson
The combined distribution andstochastic assignment problem. Ann. Oper. Res. 82 (1998)
Michael Patriksson
On the convergence of descent methods for monotone variational inequalities. Oper. Res. Lett. 16 (5) (1994)
Torbjörn Larsson, Michael Patriksson
A class of gap functions for variational inequalities. Math. Program. 64 (1994)
Torbjörn Larsson, Michael Patriksson
Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem. Transp. Sci. 26 (1) (1992)