default search action
Michael Patriksson
Person information
- affiliation: Chalmers University of Technology, Gothenburg, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j39]Efraim Laksman, Ann-Brith Strömberg
, Michael Patriksson:
The stochastic opportunistic replacement problem, part III: improved bounding procedures. Ann. Oper. Res. 292(2): 711-733 (2020) - [j38]Mahdieh Rezaei, Mohsen Afsahi
A bi-objective optimization framework for designing an efficient fuel supply chain network in post-earthquakes. Comput. Ind. Eng. 147: 106654 (2020)
2010 – 2019
- 2019
- [j37]Saeed Asadi Bagloee, Madjid Tavana
Tradable mobility permit with Bitcoin and Ethereum - A Blockchain application in transportation. Internet Things 8 (2019) - 2018
- [j36]Zuzana Nedelková
Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space. Ann. Oper. Res. 265(1): 93-118 (2018) - [j35]Saeed Asadi Bagloee
Optimization for Roads' Construction: Selection, Prioritization, and Scheduling. Comput. Aided Civ. Infrastructure Eng. 33(10): 833-848 (2018) - [j34]Saeed Asadi Bagloee
A hybrid machine-learning and optimization method to solve bi-level problems. Expert Syst. Appl. 95: 142-152 (2018) - [j33]Saeed Asadi Bagloee
Minimization of water pumps' electricity usage: A hybrid approach of regression models with optimization. Expert Syst. Appl. 107: 222-242 (2018) - 2017
- [j32]Saeed Asadi Bagloee
A Hybrid Branch-and-Bound and Benders Decomposition Algorithm for the Network Design Problem. Comput. Aided Civ. Infrastructure Eng. 32(4): 319-343 (2017) - [j31]Saeed Asadi Bagloee
A Mixed User-Equilibrium and System-Optimal Traffic Flow for Connected Vehicles Stated as a Complementarity Problem. Comput. Aided Civ. Infrastructure Eng. 32(7): 562-580 (2017) - [j30]Magnus Önnheim, Emil Gustavsson, Ann-Brith Strömberg
Ergodic, primal convergence in dual subgradient schemes for convex programming, II: the case of inconsistent primal problems. Math. Program. 163(1-2): 57-84 (2017) - 2016
- [j29]Torbjörn Larsson
"Subben's checklist" and the assessment of articles in mathematical optimization/operations research: In memoriam of Subhash C. Narula. Comput. Oper. Res. 71: 163-164 (2016) - 2015
- [j28]Michael Patriksson
The stochastic opportunistic replacement problem, part I: models incorporating individual component lives. Ann. Oper. Res. 224(1): 25-50 (2015) - [j27]Michael Patriksson
The stochastic opportunistic replacement problem, part II: a two-stage solution approach. Ann. Oper. Res. 224(1): 51-75 (2015) - [j26]Michael Patriksson
Algorithms for the continuous nonlinear resource allocation problem - New implementations and numerical studies. Eur. J. Oper. Res. 243(3): 703-722 (2015) - [j25]Emil Gustavsson, Michael Patriksson
Primal convergence from dual subgradient methods for convex optimization. Math. Program. 150(2): 365-390 (2015) - [j24]Torbjörn Larsson
A generic column generation principle: derivation and convergence analysis. Oper. Res. 15(2): 163-198 (2015) - 2014
- [j23]Emil Gustavsson, Michael Patriksson
Preventive maintenance scheduling of multi-component systems with interval costs. Comput. Ind. Eng. 76: 390-400 (2014) - 2013
- [j22]Mahmood Shafiee
An Optimal Number-Dependent Preventive Maintenance Strategy for Offshore Wind Turbine Blades Considering Logistics. Adv. Oper. Res. 2013: 205847:1-205847:12 (2013) - 2012
- [j21]Torgny Almgren, Niclas Andréasson, Michael Patriksson
The opportunistic replacement problem: theoretical analyses and numerical tests. Math. Methods Oper. Res. 76(3): 289-319 (2012) - 2011
- [j20]Ricardo García-Ródenas
Column generation algorithms for nonlinear optimization, II: Numerical investigations. Comput. Oper. Res. 38(3): 591-604 (2011) - [j19]Karin Thörnblad, Michael Patriksson
A note on the complexity of flow-shop scheduling with deteriorating jobs. Discret. Appl. Math. 159(4): 251-253 (2011) - 2010
- [j18]Maria Daneva, Torbjörn Larsson
A comparison of feasible direction methods for the stochastic transportation problem. Comput. Optim. Appl. 46(3): 451-466 (2010) - [j17]Peter Lindroth, Michael Patriksson
Approximating the Pareto optimal set using a reduced set of objective functions. Eur. J. Oper. Res. 207(3): 1519-1534 (2010)
2000 – 2009
- 2009
- [r2]Michael Patriksson:
Cost Approximation Algorithms. Encyclopedia of Optimization 2009: 567-578 - [r1]Michael Patriksson:
Simplicial Decomposition Algorithms. Encyclopedia of Optimization 2009: 3579-3585 - 2008
- [j16]Michael Patriksson
A survey on the continuous nonlinear resource allocation problem. Eur. J. Oper. Res. 185(1): 1-46 (2008) - [j15]Torbjörn Larsson
Convergent Lagrangian heuristics for nonlinear minimum cost network flows. Eur. J. Oper. Res. 189(2): 324-346 (2008) - 2007
- [p1]Patrice Marcotte, Michael Patriksson
Chapter 10 Traffic Equilibrium. Transportation 2007: 623-713 - 2006
- [j14]Torbjörn Larsson
Global Optimality Conditions for Discrete and Nonconvex Optimization - With Applications to Lagrangian Heuristics and Column Generation. Oper. Res. 54(3): 436-453 (2006) - 2004
- [j13]Michael Patriksson
Sensitivity Analysis of Traffic Equilibria. Transp. Sci. 38(3): 258-281 (2004) - 2003
- [j12]Torbjörn Larsson
On the convergence of conditional epsilon-subgradient methods for convex programs and convex-concave saddle-point problems. Eur. J. Oper. Res. 151(3): 461-473 (2003) - [j11]Torbjörn Larsson
Inverse nonlinear multicommodity flow optimization by column generation. Optim. Methods Softw. 18(5): 601-613 (2003) - [j10]Michael Patriksson
Sensitivity Analysis of Aggregated Variational Inequality Problems, with Application to Traffic Equilibria. Transp. Sci. 37(1): 56-68 (2003) - 2002
- [j9]Michael Patriksson
A Mathematical Model and Descent Algorithm for Bilevel Traffic Management. Transp. Sci. 36(3): 271-291 (2002)
1990 – 1999
- 1999
- [j8]Torbjörn Larsson
Ergodic, primal convergence in dual subgradient schemes for convex programming. Math. Program. 86(2): 283-312 (1999) - [j7]Michael Patriksson
Stochastic mathematical programs with equilibrium constraints. Oper. Res. Lett. 25(4): 159-167 (1999) - 1998
- [j6]Jan T. Lundgren, Michael Patriksson:
The combined distribution andstochastic assignment problem. Ann. Oper. Res. 82: 309-330 (1998) - [j5]Michael Patriksson:
Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets. Comput. Optim. Appl. 9(1): 5-42 (1998) - [j4]Michael Patriksson:
Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs. SIAM J. Optim. 8(2): 561-582 (1998) - 1994
- [j3]Torbjörn Larsson
A class of gap functions for variational inequalities. Math. Program. 64: 53-79 (1994) - [j2]Michael Patriksson
On the convergence of descent methods for monotone variational inequalities. Oper. Res. Lett. 16(5): 265-269 (1994) - 1992
- [j1]Torbjörn Larsson
Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem. Transp. Sci. 26(1): 4-17 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: