Patriksson Michael

Michael Patriksson

Information about the author Michael Patriksson will soon be added to the site.
Found 23 papers in total
A Hybrid Branch-and-Bound and Benders Decomposition Algorithm for the Network Design Problem
A Hybrid Branch-and-Bound and Benders Decomposition Algorithm for the Network Design Problem
2017
Given a set of candidate road projects associated with costs, finding the best subset...
Integration of expert knowledge into radial basis function surrogate models
Integration of expert knowledge into radial basis function surrogate models
2016
A current application in a collaboration between Chalmers University of Technology and...
A generic column generation principle: derivation and convergence analysis
A generic column generation principle: derivation and convergence analysis
2015
Given a non‐empty, compact and convex set, and an a priori defined condition...
The opportunistic replacement problem: theoretical analyses and numerical tests
The opportunistic replacement problem: theoretical analyses and numerical tests
2012
We consider a model for determining optimal opportunistic maintenance schedules w.r.t....
A method for simulation based optimization using radial basis functions
A method for simulation based optimization using radial basis functions
2010
We propose an algorithm for the global optimization of expensive and noisy black box...
Combustion engine optimization: a multiobjective approach
Combustion engine optimization: a multiobjective approach
2010
To simulate the physical and chemical processes inside combustion engines is possible...
A comparison of feasible direction methods for the stochastic transportation problem
A comparison of feasible direction methods for the stochastic transportation problem
2010
The feasible direction method of Frank and Wolfe has been claimed to be efficient for...
Global optimality conditions for discrete and nonconvex optimization – with applications to Lagrangian heuristics and column generation
Global optimality conditions for discrete and nonconvex optimization – with applications to Lagrangian heuristics and column generation
2006
The well-known and established global optimality conditions based on the Lagrangian...
Sensitivity analysis of traffic equilibria
Sensitivity analysis of traffic equilibria
2004
The contribution of this paper is a complete analysis of the sensitivity of elastic...
Stochastic mathematical programs with equilibrium constraints
Stochastic mathematical programs with equilibrium constraints
1999
We introduce stochastic mathematical programs with equilibrium constraints (SMPEC),...
On the convergence of conditional ϵ-subgradient methods for convex programs and convex–concave saddle-point problems
On the convergence of conditional ϵ-subgradient methods for convex programs and convex–concave saddle-point problems
2003
The paper provides two contributions. First, we present new convergence results for...
A mathematical model and descent algorithm for bilevel traffic management
A mathematical model and descent algorithm for bilevel traffic management
2002
We provide a new mathematical model for strategic traffic management, formulated and...
A mathematical model and descent algorithm for bilevel traffic management
A mathematical model and descent algorithm for bilevel traffic management
2002
We provide a new mathematical model for strategic traffic management, formulated and...
Network design applications of the class of column generation/simplicial decomposition algorithms in convex differentiable optimization
Network design applications of the class of column generation/simplicial decomposition algorithms in convex differentiable optimization
2001
A new class of column generation/simplicial decomposition method for non linear convex...
Ergodic, primal convergence in dual subgradient schemes for convex programming
Ergodic, primal convergence in dual subgradient schemes for convex programming
1999
Lagrangean dualization and subgradient optimization techniques are frequently used...
Side constrained traffic equilibrium models – analysis, computation and applications
Side constrained traffic equilibrium models – analysis, computation and applications
1999
We consider the introduction of side constraints for refining a descriptive or...
Decomposition methods for differentiable optimization problems over Cartesian product sets
Decomposition methods for differentiable optimization problems over Cartesian product sets
1998
This paper presents a unified analysis of decomposition algorithms for continuously...
The combined distribution and stochastic assignment problem
The combined distribution and stochastic assignment problem
1998
The combined distribution and assignment problem is the problem of the simultaneous...
Conditional subgradient optimization – theory and applications
Conditional subgradient optimization – theory and applications
1996
We generalize the subgradient optimization method for nondifferentiable convex...
A unified description of iterative algorithms for traffic equilibria
A unified description of iterative algorithms for traffic equilibria
1993
The purpose of this paper is to provide a unified description of iterative algorithms...
An algorithm for the stochastic user equilibrium problem
An algorithm for the stochastic user equilibrium problem
1996
In this paper the authors present a new algorithm for the approximate solution of the...
An augmented Lagrangean dual algorithm for link capacity side constrained traffic assignment problems
An augmented Lagrangean dual algorithm for link capacity side constrained traffic assignment problems
1995
As a means to obtain a more accurate description of traffic fiows than that provided...
A class of gap functions for variational inequalities
A class of gap functions for variational inequalities
1994
Recently Auchmuty has introduced a new class of merit functions, or optimization...
Papers per page: