Kaj Holmberg

Mikael Call, Kaj Holmberg: Complexity of Inverse Shortest Path Routing. INOC 2011: 339-353

Kaj Holmberg: Heuristics for the rural postman problem. Computers & OR 37(5): 981-990 (2010)

Oleg Burdakov, Patrick Doherty, Kaj Holmberg, Jonas Kvarnström, Per-Magnus Olsson: Relay Positioning for Unmanned Aerial Vehicle Surveillance. I. J. Robotic Res. 29(8): 1069-1087 (2010)

Oleg Burdakov, Patrick Doherty, Kaj Holmberg, Per-Magnus Olsson: Optimal placement of UV-based communications relay nodes. J. Global Optimization 48(4): 511-531 (2010)

Per-Magnus Olsson, Jonas Kvarnström, Patrick Doherty, Oleg Burdakov, Kaj Holmberg: Generating UAV communication networks for monitoring and surveillance. ICARCV 2010: 1070-1077

Peter Broström, Kaj Holmberg: Compatible Weights and Valid Cycles in Non-spanning OSPF Routing Patterns. Algorithmic Operations Research 4(1): 19-35 (2009)

Kaj Holmberg: Graph Optimization Approaches for Minimal Rerouting in Symmetric Three Stage Clos Networks. J. Math. Model. Algorithms 8(1): 81-100 (2009)

Peter Broström, Kaj Holmberg: Design of OSPF networks using subpath consistent routing patterns. Telecommunication Systems 41(4): 293-309 (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

Kaj Holmberg: Facility Location Problems with Spatial Interaction. Encyclopedia of Optimization 2009: 982-989

Kaj Holmberg: Facility Location with Staircase Costs. Encyclopedia of Optimization 2009: 989-995

Kaj Holmberg: MINLP: Generalized Cross Decomposition. Encyclopedia of Optimization 2009: 2148-2155

Kaj Holmberg: Stochastic Transportation and Location Problems. Encyclopedia of Optimization 2009: 3824-3829

Kaj Holmberg, Martin Joborn, Kennet Melin: Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths. European Journal of Operational Research 188(1): 101-108 (2008)

Peter Broström, Kaj Holmberg: Valid cycles: A source of infeasibility in open shortest path first routing. Networks 52(4): 206-215 (2008)

Peter Broström, Kaj Holmberg: Multiobjective design of survivable IP networks. Annals OR 147(1): 235-253 (2006)

Anders J. V. Skriver, Kim Allan Andersen, Kaj Holmberg: Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives. European Journal of Operational Research 156(3): 541-549 (2004)

Kaj Holmberg, Di Yuan: Optimization of Internet Protocol network design and routing. Networks 43(1): 39-53 (2004)

Martin Joborn, Teodor Gabriel Crainic, Michel Gendreau, Kaj Holmberg, Jan T. Lundgren: Economies of Scale in Empty Freight Car Distribution in Scheduled Railways. Transportation Science 38(2): 121-134 (2004)

Kaj Holmberg, Di Yuan: A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation. INFORMS Journal on Computing 15(1): 42-57 (2003)

Mathias Henningsson, Kaj Holmberg, Mikael Rönnqvist, Peter Värbrand: Ring Network Design by Lagrangean Based Column Generation. Telecommunication Systems 21(2): 301-318 (2002)

Kaj Holmberg, Mikael Rönnqvist, Di Yuan: An exact algorithm for the capacitated facility location problems with single sourcing. European Journal of Operational Research 113(3): 544-559 (1999)

Kaj Holmberg: Exact solution methods for uncapacitated location problems with convex transportation costs. European Journal of Operational Research 114(1): 127-140 (1999)

Kaj Holmberg, Martin Joborn, Jan T. Lundgren: Improved Empty Freight Car Distribution. Transportation Science 32(2): 163-173 (1998)

Kaj Holmberg: A convergence proof for linear mean value cross decomposition. Math. Meth. of OR 39(2): 157-186 (1994)

Kaj Holmberg: On the Convergence of Cross Decomposition. Math. Program. 47: 269-296 (1990)