Torbjörn Larsson

Orcid: 0000-0003-2094-7376

According to our database1, Torbjörn Larsson authored at least 44 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Lagrangian bounding and heuristic principle for bi-objective discrete optimization.
Oper. Res., June, 2024

2022
Column generation extensions of set covering greedy heuristics.
Oper. Res. Lett., 2022

Long term projection of the demographic and financial evolution of the parliamentary pension scheme of Uganda.
Oper. Res. Decis., 2022

Asset liability management for the Bank of Uganda defined benefits scheme by stochastic programming.
Oper. Res. Decis., 2022

Dissecting the duality gap: the supporting hyperplane interpretation revisited.
Optim. Lett., 2022

Approximating the Pareto frontier for a challenging real-world bi-objective covering problem.
INFOR Inf. Syst. Oper. Res., 2022

A theoretical justification of the set covering greedy heuristic of Caprara et al.
Discret. Optim., 2022

2021
Global Pricing and Feasible Directions in Linear Programming.
Proceedings of the Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31, 2021

2020
An integer programming column generation principle for heuristic search methods.
Int. Trans. Oper. Res., 2020

Automating the planning of container loading for Atlas Copco: Coping with real-life stacking and stability constraints.
Eur. J. Oper. Res., 2020

2019
An integer optimality condition for column generation on zero-one linear programs.
Discret. Optim., 2019

A Steepest Feasible Direction Extension of the Simplex Method.
Proceedings of the Operations Research Proceedings 2019, 2019

A Dissection of the Duality Gap of Set Covering Problems.
Proceedings of the Operations Research Proceedings 2019, 2019

2018
The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation.
J. Glob. Optim., 2018

2017
Ergodic, primal convergence in dual subgradient schemes for convex programming, II: the case of inconsistent primal problems.
Math. Program., 2017

Preventing Hot Spots in High Dose-Rate Brachytherapy.
Proceedings of the Operations Research Proceedings 2017, 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

Heuristics for integrated optimization of catheter positioning and dwell time distribution in prostate HDR brachytherapy.
Ann. Oper. Res., 2016

2015
A generic column generation principle: derivation and convergence analysis.
Oper. Res., 2015

Military aircraft mission planning - Efficient model-based metaheuristic approaches.
Optim. Lett., 2015

2014
A maximum flow formulation of a multi-period open-pit mining problem.
Oper. Res., 2014

All-integer column generation for set partitioning: Basic principles and extensions.
Eur. J. Oper. Res., 2014

Tight Upper Bounds on the Cardinality Constrained Mean-Variance Portfolio Optimization Problem Using Truncated Eigendecomposition.
Proceedings of the Operations Research Proceedings 2014, 2014

A Time-Indexed Generalized Vehicle Routing Model for Military Aircraft Mission Planning.
Proceedings of the Operations Research Proceedings 2014, 2014

2013
Military aircraft mission planning: a generalized vehicle routing model with synchronization and precedence.
EURO J. Transp. Logist., 2013

Power efficient uplink scheduling in SC-FDMA: Bounding global optimality by column generation.
Proceedings of the IEEE 18th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, 2013

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

Allocation of Link Flow Detectors for Origin-Destination Matrix Estimation - A Comparative Study.
Comput. Aided Civ. Infrastructure Eng., 2010

2009
Column generation in the integral simplex method.
Eur. J. Oper. Res., 2009

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

2007
Lagrangian Relaxation via Ballstep Subgradient Methods.
Math. Oper. Res., 2007

2006
A note on relatives to the Held and Karp 1-tree problem.
Oper. Res. Lett., 2006

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

A stabilized column generation scheme for the traveling salesman subtour problem.
Discret. Appl. Math., 2006

2004
An Augmented Lagrangian Algorithm for Large Scale Multicommodity Routing.
Comput. Optim. Appl., 2004

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

1999
Ergodic, primal convergence in dual subgradient schemes for convex programming.
Math. Program., 1999

The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization.
Math. Oper. Res., 1999

1998
TCP position tolerances in joint torque minimizations.
Proceedings of the Proceedings 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, 1998

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

A Set Covering Reformulation of the Pure Fixed Charge Transportation Problem.
Discret. Appl. Math., 1994

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

A characterization of the uncapacitated network design polytope.
Oper. Res. Lett., 1992


  Loading...