Michael Patriksson

According to our database1, Michael Patriksson authored at least 42 papers between 1992 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

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
A hybrid machine-learning and optimization method to solve bi-level problems.
Expert Syst. Appl., 2018

Minimization of water pumps' electricity usage: A hybrid approach of regression models with optimization.
Expert Syst. Appl., 2018

Optimization for Roads' Construction: Selection, Prioritization, and Scheduling.
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
A generic column generation principle: derivation and convergence analysis.
Oper. Res., 2015

Primal convergence from dual subgradient methods for convex optimization.
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
Preventive maintenance scheduling of multi-component systems with interval costs.
Comput. Ind. Eng., 2014

2013
An Optimal Number-Dependent Preventive Maintenance Strategy for Offshore Wind Turbine Blades Considering Logistics.
Adv. Oper. Res., 2013

2012
The opportunistic replacement problem: theoretical analyses and numerical tests.
Math. Methods Oper. Res., 2012

2011
A note on the complexity of flow-shop scheduling with deteriorating jobs.
Discret. Appl. Math., 2011

Column generation algorithms for nonlinear optimization, II: Numerical investigations.
Comput. Oper. Res., 2011

2010
Approximating the Pareto optimal set using a reduced set of objective functions.
Eur. J. Oper. Res., 2010

A comparison of feasible direction methods for the stochastic transportation problem.
Comput. Optim. Appl., 2010

2009
Simplicial Decomposition Algorithms.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Cost Approximation Algorithms.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

2008
A survey on the continuous nonlinear resource allocation problem.
Eur. J. Oper. Res., 2008

Convergent Lagrangian heuristics for nonlinear minimum cost network flows.
Eur. J. Oper. Res., 2008

2007
Chapter 10 Traffic Equilibrium.
Proceedings of the Transportation, 2007

2006
Global Optimality Conditions for Discrete and Nonconvex Optimization - With Applications to Lagrangian Heuristics and Column Generation.
Oper. Res., 2006

2004
Sensitivity Analysis of Traffic Equilibria.
Transp. Sci., 2004

2003
Sensitivity Analysis of Aggregated Variational Inequality Problems, with Application to Traffic Equilibria.
Transp. Sci., 2003

Inverse nonlinear multicommodity flow optimization by column generation.
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
A Mathematical Model and Descent Algorithm for Bilevel Traffic Management.
Transp. Sci., 2002

1999
Stochastic mathematical programs with equilibrium constraints.
Oper. Res. Lett., 1999

Ergodic, primal convergence in dual subgradient schemes for convex programming.
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

The combined distribution andstochastic assignment problem.
Ann. Oper. Res., 1998

1994
On the convergence of descent methods for monotone variational inequalities.
Oper. Res. Lett., 1994

A class of gap functions for variational inequalities.
Math. Program., 1994

1992
Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem.
Transp. Sci., 1992


  Loading...