On the Convergence of Cross Decomposition. - Kaj Holmberg (Math. Program., 1990)

Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts. - Kaj Holmberg (Oper. Res., 1994)

A convergence proof for linear mean value cross decomposition. - Kaj Holmberg (Math. Methods Oper. Res., 1994)

Efficient decomposition and linearization methods for the stochastic transportation problem. - Kaj Holmberg (Comput. Optim. Appl., 1995)

Creative modeling: Variable and constraint duplicationin primal - dual decomposition methods. - Kaj Holmberg (Ann. Oper. Res., 1998)

Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound. - Kaj Holmberg; Johan Hellstrand (Oper. Res., 1998)

Improved Empty Freight Car Distribution. - Kaj Holmberg; Martin Joborn; Jan T. Lundgren (Transp. Sci., 1998)

Exact solution methods for uncapacitated location problems with convex transportation costs. - Kaj Holmberg (Eur. J. Oper. Res., 1999)

An exact algorithm for the capacitated facility location problems with single sourcing. - Kaj Holmberg; Mikael Rönnqvist; Di Yuan 001 (Eur. J. Oper. Res., 1999)

A production-transportation problem with stochastic demand and concave production costs. - Kaj Holmberg; Hoang Tuy (Math. Program., 1999)

A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem. - Kaj Holmberg; Di Yuan 001 (Oper. Res., 2000)

Optimal Network Design and Routing for IP Traffic. - Kaj Holmberg; Di Yuan 001 (DRCN, 2001)

Ring Network Design by Lagrangean Based Column Generation. - Mathias Henningsson; Kaj Holmberg; Mikael Rönnqvist; Peter Värbrand (Telecommun. Syst., 2002)

A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation. - Kaj Holmberg; Di Yuan 001 (INFORMS J. Comput., 2003)

Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives. - Anders J. V. Skriver; Kim Allan Andersen; Kaj Holmberg (Eur. J. Oper. Res., 2004)

Optimization of Internet Protocol network design and routing. - Kaj Holmberg; Di Yuan 001 (Networks, 2004)

Economies of Scale in Empty Freight Car Distribution in Scheduled Railways. - Martin Joborn; Teodor Gabriel Crainic; Michel Gendreau; Kaj Holmberg; Jan T. Lundgren (Transp. Sci., 2004)

Ring Network Design. - Mathias Henningsson; Kaj Holmberg; Di Yuan 001 (Handbook of Optimization in Telecommunications, 2006)

Multiobjective design of survivable IP networks. - Peter Broström; Kaj Holmberg (Ann. Oper. Res., 2006)

Mean value cross decomposition for nonlinear convex problems. - Kaj Holmberg; Krzysztof C. Kiwiel (Optim. Methods Softw., 2006)

Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths. - Kaj Holmberg; Martin Joborn; Kennet Melin (Eur. J. Oper. Res., 2008)

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

Positioning unmanned aerial vehicles as communication relays for surveillance tasks. - Oleg Burdakov; Patrick Doherty 001; Kaj Holmberg; Jonas Kvarnström; Per-Magnus Olsson (Robotics: Science and Systems, 2009)

Compatible Weights and Valid Cycles in Non-spanning OSPF Routing Patterns. - Peter Broström; Kaj Holmberg (Algorithmic Oper. Res., 2009)

Graph Optimization Approaches for Minimal Rerouting in Symmetric Three Stage Clos Networks. - Kaj Holmberg (J. Math. Model. Algorithms, 2009)

Design of OSPF networks using subpath consistent routing patterns. - Peter Broström; Kaj Holmberg (Telecommun. Syst., 2009)

Facility Location Problems with Spatial Interaction. - Kaj Holmberg (Encyclopedia of Optimization, 2009)

Facility Location with Staircase Costs. - Kaj Holmberg (Encyclopedia of Optimization, 2009)

MINLP: Generalized Cross Decomposition. - Kaj Holmberg (Encyclopedia of Optimization, 2009)

Stochastic Transportation and Location Problems. - Kaj Holmberg (Encyclopedia of Optimization, 2009)

Optimization of OSPF Routing in IP Networks. - Andreas Bley; Bernard Fortz; Éric Gourdin; Kaj Holmberg; Olivier Klopfenstein; Michal Pióro; Artur Tomaszewski; Hakan Ümit (Graphs and Algorithms in Communication Networks, 2010)

Generating UAV communication networks for monitoring and surveillance. - Per-Magnus Olsson; Jonas Kvarnström; Patrick Doherty 001; Oleg Burdakov; Kaj Holmberg (ICARCV, 2010)

Heuristics for the rural postman problem. - Kaj Holmberg (Comput. Oper. Res., 2010)

Relay Positioning for Unmanned Aerial Vehicle Surveillance. - Oleg Burdakov; Patrick Doherty 001; Kaj Holmberg; Jonas Kvarnström; Per-Magnus Olsson (Int. J. Robotics Res., 2010)

Optimal placement of UV-based communications relay nodes. - Oleg Burdakov; Patrick Doherty 001; Kaj Holmberg; Per-Magnus Olsson (J. Glob. Optim., 2010)

Complexity of Inverse Shortest Path Routing. - Mikael Call; Kaj Holmberg (INOC, 2011)

Inverse Shortest Path Models Based on Fundamental Cycle Bases. - Mikael Call; Kaj Holmberg (OR, 2011)

Military aircraft mission planning: a generalized vehicle routing model with synchronization and precedence. - Nils-Hassan Quttineh; Torbjörn Larsson; Kristian Lundberg; Kaj Holmberg (EURO J. Transp. Logist., 2013)

Formation of student groups with the help of optimisation. - Kaj Holmberg (J. Oper. Res. Soc., 2019)

The (Over)zealous Snow Remover Problem. - Kaj Holmberg (Transp. Sci., 2019)

A branch-and-dive heuristic for single vehicle snow removal. - Roghayeh Hajizadeh; Kaj Holmberg (Networks, 2020)