Michael Patriksson
Orcid: 0000-0001-7675-7454Affiliations:
- Chalmers University of Technology, Gothenburg, Sweden
According to our database1,
Michael Patriksson
authored at least 42 papers
between 1992 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on chalmers.se
On csauthors.net:
Bibliography
2020
A bi-objective optimization framework for designing an efficient fuel supply chain network in post-earthquakes.
Comput. Ind. Eng., 2020
The stochastic opportunistic replacement problem, part III: improved bounding procedures.
Ann. Oper. Res., 2020
2019
Tradable mobility permit with Bitcoin and Ethereum - A Blockchain application in transportation.
Internet Things, 2019
2018
Expert Syst. Appl., 2018
Minimization of water pumps' electricity usage: A hybrid approach of regression models with optimization.
Expert Syst. Appl., 2018
Comput. Aided Civ. Infrastructure Eng., 2018
Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space.
Ann. Oper. Res., 2018
2017
Ergodic, primal convergence in dual subgradient schemes for convex programming, II: the case of inconsistent primal problems.
Math. Program., 2017
A Mixed User-Equilibrium and System-Optimal Traffic Flow for Connected Vehicles Stated as a Complementarity Problem.
Comput. Aided Civ. Infrastructure Eng., 2017
A Hybrid Branch-and-Bound and Benders Decomposition Algorithm for the Network Design Problem.
Comput. Aided Civ. Infrastructure Eng., 2017
2016
"Subben's checklist" and the assessment of articles in mathematical optimization/operations research: In memoriam of Subhash C. Narula.
Comput. Oper. Res., 2016
2015
Oper. Res., 2015
Math. Program., 2015
Algorithms for the continuous nonlinear resource allocation problem - New implementations and numerical studies.
Eur. J. Oper. Res., 2015
The stochastic opportunistic replacement problem, part II: a two-stage solution approach.
Ann. Oper. Res., 2015
The stochastic opportunistic replacement problem, part I: models incorporating individual component lives.
Ann. Oper. Res., 2015
2014
Comput. Ind. Eng., 2014
2013
An Optimal Number-Dependent Preventive Maintenance Strategy for Offshore Wind Turbine Blades Considering Logistics.
Adv. Oper. Res., 2013
2012
Math. Methods Oper. Res., 2012
2011
Discret. Appl. Math., 2011
Column generation algorithms for nonlinear optimization, II: Numerical investigations.
Comput. Oper. Res., 2011
2010
Eur. J. Oper. Res., 2010
A comparison of feasible direction methods for the stochastic transportation problem.
Comput. Optim. Appl., 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
2008
Eur. J. Oper. Res., 2008
Eur. J. Oper. Res., 2008
2007
2006
Global Optimality Conditions for Discrete and Nonconvex Optimization - With Applications to Lagrangian Heuristics and Column Generation.
Oper. Res., 2006
2004
2003
Sensitivity Analysis of Aggregated Variational Inequality Problems, with Application to Traffic Equilibria.
Transp. Sci., 2003
Optim. Methods Softw., 2003
On the convergence of conditional epsilon-subgradient methods for convex programs and convex-concave saddle-point problems.
Eur. J. Oper. Res., 2003
2002
Transp. Sci., 2002
1999
Oper. Res. Lett., 1999
Math. Program., 1999
1998
Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs.
SIAM J. Optim., 1998
Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets.
Comput. Optim. Appl., 1998
1994
Oper. Res. Lett., 1994
1992
Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem.
Transp. Sci., 1992