Larsson Torbjrn

Torbjrn Larsson

Information about the author Torbjrn Larsson will soon be added to the site.
Found 18 papers in total
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...
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...
Automating the self-scheduling process of nurses in Swedish healthcare: a pilot study
Automating the self-scheduling process of nurses in Swedish healthcare: a pilot study
2010
Hospital wards need to be staffed by nurses round the clock, resulting in irregular...
Lagrangian Relaxation via Ballstep Subgradient Methods
Lagrangian Relaxation via Ballstep Subgradient Methods
2007
We exhibit useful properties of ballstep subgradient methods for convex optimization...
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...
A note on relatives to the Held and Karp 1-tree problem
A note on relatives to the Held and Karp 1-tree problem
2006
We study a class of graph problems which includes as special cases the Held and Karp...
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...
An augmented Lagrangian algorithm for large scale multicommodity routing
An augmented Lagrangian algorithm for large scale multicommodity routing
2004
The linear multicommodity network flow (MCNF) problem has many applications in the...
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...
Conditional subgradient optimization – theory and applications
Conditional subgradient optimization – theory and applications
1996
We generalize the subgradient optimization method for nondifferentiable convex...
A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
1994
We propose a heuristic solution technique for the capacitated concave minimum cost...
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...
A set covering reformulation of the pure fixed charge transportation problem
A set covering reformulation of the pure fixed charge transportation problem
1994
The pure fixed charge transportation problem is reformulated into an equivalent set...
A characterization of the uncapacitated network design polytope
A characterization of the uncapacitated network design polytope
1992
The uncapacitated network design problem is considered. The authors show that the...
A Benders decomposition based heuristic for the hierarchical production planning problem
A Benders decomposition based heuristic for the hierarchical production planning problem
1990
In this paper a heuristic procedure for determining good feasible solutions to a...
Lagrangean relaxation and subgradient optimization applied to optimal design with discrete sizing
Lagrangean relaxation and subgradient optimization applied to optimal design with discrete sizing
1990
The discrete sizing problem in optimal design is addressed. Lagrangean dual approaches...
Papers per page: