Kaj Holmberg

Publication Activity (10 Years)

Years Active: 1990-2020
Publications (10 Years): 3

Top Topics

Solar Radiation

Vehicle Routing

Optimisation Algorithm

Top Venues

EURO J. Transp. Logist.

J. Oper. Res. Soc.

Publications

Roghayeh Hajizadeh, Kaj Holmberg
A branch-and-dive heuristic for single vehicle snow removal. Networks 76 (4) (2020)
Kaj Holmberg
Formation of student groups with the help of optimisation. J. Oper. Res. Soc. 70 (9) (2019)
Kaj Holmberg
The (Over)zealous Snow Remover Problem. Transp. Sci. 53 (3) (2019)
Nils-Hassan Quttineh, Torbjörn Larsson, Kristian Lundberg, Kaj Holmberg
Military aircraft mission planning: a generalized vehicle routing model with synchronization and precedence. EURO J. Transp. Logist. 2 (1-2) (2013)
Mikael Call, Kaj Holmberg
Inverse Shortest Path Models Based on Fundamental Cycle Bases. OR (2011)
Mikael Call, Kaj Holmberg
Complexity of Inverse Shortest Path Routing. INOC (2011)
Oleg Burdakov, Patrick Doherty, Kaj Holmberg, Per-Magnus Olsson
Optimal placement of UV-based communications relay nodes. J. Glob. Optim. 48 (4) (2010)
Per-Magnus Olsson, Jonas Kvarnström, Patrick Doherty, Oleg Burdakov, Kaj Holmberg
Generating UAV communication networks for monitoring and surveillance. ICARCV (2010)
Kaj Holmberg
Heuristics for the rural postman problem. Comput. Oper. Res. 37 (5) (2010)
Oleg Burdakov, Patrick Doherty, Kaj Holmberg, Jonas Kvarnström, Per-Magnus Olsson
Relay Positioning for Unmanned Aerial Vehicle Surveillance. Int. J. Robotics Res. 29 (8) (2010)
Kaj Holmberg
Graph Optimization Approaches for Minimal Rerouting in Symmetric Three Stage Clos Networks. J. Math. Model. Algorithms 8 (1) (2009)
Peter Broström, Kaj Holmberg
Compatible Weights and Valid Cycles in Non-spanning OSPF Routing Patterns. Algorithmic Oper. Res. 4 (1) (2009)
Oleg Burdakov, Patrick Doherty, Kaj Holmberg, Jonas Kvarnström, Per-Magnus Olsson
Positioning unmanned aerial vehicles as communication relays for surveillance tasks. Robotics: Science and Systems (2009)
Peter Broström, Kaj Holmberg
Design of OSPF networks using subpath consistent routing patterns. Telecommun. Syst. 41 (4) (2009)
Peter Broström, Kaj Holmberg
Valid cycles: A source of infeasibility in open shortest path first routing. Networks 52 (4) (2008)
Kaj Holmberg, Martin Joborn, Kennet Melin
Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths. Eur. J. Oper. Res. 188 (1) (2008)
Peter Broström, Kaj Holmberg
Multiobjective design of survivable IP networks. Ann. Oper. Res. 147 (1) (2006)
Kaj Holmberg, Krzysztof C. Kiwiel
Mean value cross decomposition for nonlinear convex problems. Optim. Methods Softw. 21 (3) (2006)
Martin Joborn, Teodor Gabriel Crainic, Michel Gendreau, Kaj Holmberg, Jan T. Lundgren
Economies of Scale in Empty Freight Car Distribution in Scheduled Railways. Transp. Sci. 38 (2) (2004)
Anders J. V. Skriver, Kim Allan Andersen, Kaj Holmberg
Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives. Eur. J. Oper. Res. 156 (3) (2004)
Kaj Holmberg, Di Yuan
Optimization of Internet Protocol network design and routing. Networks 43 (1) (2004)
Kaj Holmberg, Di Yuan
A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation. INFORMS J. Comput. 15 (1) (2003)
Mathias Henningsson, Kaj Holmberg, Mikael Rönnqvist, Peter Värbrand
Ring Network Design by Lagrangean Based Column Generation. Telecommun. Syst. 21 (2) (2002)
Kaj Holmberg, Di Yuan
Optimal Network Design and Routing for IP Traffic. DRCN (2001)
Kaj Holmberg, Di Yuan
A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem. Oper. Res. 48 (3) (2000)
Kaj Holmberg, Hoang Tuy
A production-transportation problem with stochastic demand and concave production costs. Math. Program. 85 (1) (1999)
Kaj Holmberg, Mikael Rönnqvist, Di Yuan
An exact algorithm for the capacitated facility location problems with single sourcing. Eur. J. Oper. Res. 113 (3) (1999)
Kaj Holmberg
Exact solution methods for uncapacitated location problems with convex transportation costs. Eur. J. Oper. Res. 114 (1) (1999)
Kaj Holmberg
Creative modeling: Variable and constraint duplicationin primal - dual decomposition methods. Ann. Oper. Res. 82 (1998)
Kaj Holmberg, Martin Joborn, Jan T. Lundgren
Improved Empty Freight Car Distribution. Transp. Sci. 32 (2) (1998)
Kaj Holmberg, Johan Hellstrand
Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound. Oper. Res. 46 (2) (1998)
Kaj Holmberg
Efficient decomposition and linearization methods for the stochastic transportation problem. Comput. Optim. Appl. 4 (4) (1995)
Kaj Holmberg
A convergence proof for linear mean value cross decomposition. Math. Methods Oper. Res. 39 (2) (1994)
Kaj Holmberg
Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts. Oper. Res. 42 (4) (1994)
Kaj Holmberg
On the Convergence of Cross Decomposition. Math. Program. 47 (1990)