Mikael Call and Kaj Holmberg. Complexity of Inverse Shortest Path Routing. In: J. Pahl, T. Reiners, and S. Voß (Eds.): Network Optimization, INOC 2011, Computer Communication Networks and Telecommunications, Lecture Notes in Computer Science 6701: 339-353. Springer, Heidelberg, 2011.
Oleg Burdakov, Patrick Doherty, Kaj Holmberg and Per-Magnus Olsson. Optimal Placement of UV-based Communications Relay Nodes. Journal of Global Optimization 48: 511-531, 2010.
Oleg Burdakov, Patrick Doherty, Kaj Holmberg, Jonas Kvarnström and Per-Magnus Olsson. Relay Positioning for Unmanned Aerial Vehicle Surveillance. The International Journal of Robotics Research 29: 1069-1087, 2010.
Kaj Holmberg. Heuristics for the Rural Postman Problem. Computers & Operations Research 37: 981-990, 2010.
Peter Broström and Kaj Holmberg. Design of OSPF Networks using Subpath Consistent Routing Patterns. Telecommunication Systems 41: 293-309, 2009.
Kaj Holmberg. Graph Optimization Approaches for Minimal Rerouting in Symmetric Three Stage Clos Networks. Journal of Mathematical Modelling and Algorithms 8: 81-100, 2009.
Peter Broström and Kaj Holmberg. Compatible Weights and Valid Cycles in Non-spanning OSPF Routing Patterns. Algorithmic Operations Research 4: 19-35, 2009.
Peter Broström and Kaj Holmberg. Valid Cycles: A Source of Infeasibility in Open Shortest Path First Routing Routing. Networks 52: 206-215, 2008.
Kaj Holmberg, Martin Joborn and Kennet Melin. Lagrangian Based Heuristics for the Multicommodity Network Flow Problem with Fixed Costs on Paths. European Journal of Operational Research 188: 101-108, 2008.
Kaj Holmberg. Optimization Models for Routing in Switching Networks of Clos Type with Many Stages. AMO - Advanced Modeling and Optimization 10:1, 2008.
Peter Broström and Kaj Holmberg. On the Extremal Structure of an OSPF Related Cone. Vietnam Journal of Mathematics 35, 507-522, 2007.
Peter Broström and Kaj Holmberg. Multiobjective Design of Survivable IP Networks. Annals of Operations Research 147: 235-253, 2006.
Kaj Holmberg and Krzysztof Kiwiel. Mean Value Cross Decomposition for Nonlinear Convex Problems. Optimization Methods and Software 21: 401-417, 2006.
M. Joborn, T.G. Crainic, M. Gendreau, K. Holmberg and J.T. Lundgren. Economies of Scale in Empty Freight Car Distribution in Scheduled Railways. Transportation Science 38: 121-134, 2004.
A.J.V. Skriver, K.A. Andersen and K. Holmberg. Bicriteria Network Location (BNL) Problems with Criteria Dependent Lengths and Minisum Objectives. European Journal of Operational Research 156: 541-549, 2004.
Kaj Holmberg and Di Yuan. Optimization of Internet Protocol Network Design and Routing. Networks 43: 39-53, 2004.
Kaj Holmberg and Di Yuan. A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation. INFORMS Journal on Computing 15: 42-57, 2003.
M. Henningsson, K. Holmberg, M. Rönnqvist and P. Värbrand. Ring Network Design by Lagrangean Based Column Generation. Telecommunication Systems 21:2-4: 301-318, 2002.
Kaj Holmberg. Experiments with Primal-Dual Decomposition and Subgradient Methods for the Uncapacitated Facility Location Problem. Optimization 49: 495-516, 2001
Kaj Holmberg and Di Yuan. A Lagrangean Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem. Operations Research 48: 461-481, 2000.
Kaj Holmberg and Hoang Tuy. A Production-Transportation Problem with Stochastic Demand and Concave Production Costs. Mathematical Programming 85: 157-179, 1999.
Kaj Holmberg. Exact Solution Methods for Uncapacitated Location Problems with Convex Transportation Costs. European Journal of Operational Research 114: 127-140, 1999.
Kaj Holmberg, Mikael Rönnqvist and Di Yuan. An Exact Algorithm for the Capacitated Facility Location Problems with Single Sourcing. European Journal of Operational Research 113: 544-559, 1999.
Kaj Holmberg and Di Yuan. A Lagrangean Approach to Network Design Problems. International Transactions in Operational Research 5: 529-539, 1998.
Kaj Holmberg. Creative Modeling: Variable and Constraint Duplication in Primal-Dual Decomposition Methods. Annals of Operations Research 82: 355-390, 1998.
Kaj Holmberg, Martin Joborn and Jan T. Lundgren. Improved Empty Freight Car Distribution. Transportation Science 32: 163-173, 1998.
Kaj Holmberg and Johan Hellstrand. Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound. Operations Research 46: 247-259, 1998.
Kaj Holmberg and Jonas Ling. A Lagrangean Heuristic for the Facility Location Problem with Staircase Costs. European Journal of Operational Research 97: 63-74, 1997.
Kaj Holmberg. Mean Value Cross Decomposition Applied to Integer Programming Problems. European Journal of Operational Research 97: 124-138, 1997.
Kaj Holmberg and Kurt Jörnsten. Dual Search Procedures for the Exact Formulation of the Simple Plant Location Problem with Spatial Interaction. Location Science 4: 83-100, 1996.
Kaj Holmberg and Kurt Jörnsten. Solving the Generalized Knapsack Problem with Variable Coefficients. Naval Research Logistics 43: 673-689, 1996.
Kaj Holmberg and Kurt Jörnsten. A Dual Ascent Procedure for the Exact Formulation of the Simple Plant Location Problem with Spatial Interaction. Optimization 36: 139-152, 1995.
Kaj Holmberg. Primal and Dual Decomposition as Organizational Design: Price and/or Resource Directive Decomposition. In: Design Models for Hierarchical Organizations: Computation, Information, and Decentralization, eds.\ R.~M.~Burton and B.~Obel, 61-92, Kluwer Academic Publishers, Boston, USA, 1995.
Kaj Holmberg. Efficient Decomposition and Linearization Methods for the Stochastic Transportation Problem. Computational Optimization and Applications 4: 293-316, 1995.
Kaj Holmberg and Kurt Jörnsten. A Simple Modification of Dantzig-Wolfe Decomposition. Optimization 34: 129-145, 1995.
Kaj Holmberg. Cross decomposition applied to integer programming problems: Duality gaps and convexification in parts. Operations Research, 42: 657-668, 1994.
Kaj Holmberg. On using approximations of the Benders master problem. European Journal of Operational Research, 77: 111-125, 1994.
Kaj Holmberg. Solving the staircase cost facility location problem with decomposition and piecewise linearization. European Journal of Operational Research, 75: 41-61, 1994.
Kaj Holmberg. A convergence proof for linear mean value cross decomposition. Zeitschrift fur Operations Research, 39: 157-186, 1994.
Kaj Holmberg. Linear mean value cross decomposition: A generalization of the Kornai-Liptak method. European Journal of Operational Research, 62: 55-73, 1992.
Kaj Holmberg. Generalized cross decomposition applied to nonlinear integer programming problems: Duality gaps and convexification in parts. Optimization, 23: 341-356, 1992.
Kaj Holmberg. On the convergence of cross decomposition. Mathematical Programming, 47: 269-296, 1990.
Kaj Holmberg and Kurt Jörnsten. Exact methods for gravity trip distribution models. Environment and Planning A, 21: 81-97, 1989.
Kaj Holmberg and Kurt Jörnsten. Cross decomposition applied to the stochastic transportation problem. European Journal of Operational Research, 17: 361-368, 1984.
Mikael Call and Kaj Holmberg. Inverse Shortest Path Models Based on Fundamental Cycle Bases. Operations Research Proceedings 2011, eds: Diethard Klatte, Hans-Jakob Lüthi, Karl Schmedders.
Oleg Burdakov, Patrick Doherty, Kaj Holmberg, Jonas Kvarnström and Per-Magnus Olsson. Generating UAV communication networks for monitoring and surveillance. 11th International Conference on Control, Automation, Robotics and Vision, ICARCV 2010.
Eleftherios Karipidis, Erik G. Larsson and Kaj Holmberg. Optimal Scheduling and QoS Power Control for Cognitive Underlay Networks. Proceedings of the 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP'09), 2009.
Oleg Burdakov, Patrick Doherty, Kaj Holmberg, Jonas Kvarnström and Per-Magnus Olsson. Position Unmanned Aerial Vehicles as Communication Relays for Surveillance Tasks. Proceedings of the 5th Robotics, Science and Systems Conference (RSS), Seattle, Washington, June 2009.
Peter Broström and Kaj Holmberg. Determining the Non-Existence of a Compatible OSPF Metric. Proceedings of the International Network Optimization Conference, INOC 2005. Eds. L. Gouveia and C. Mourao, University of Lisbon, Portugal.
Peter Broström and Kaj Holmberg. Design of IP/OSPF Networks Using a Lagrangean Heuristic on an In-graph Based Model. Proceedings of the International Network Optimization Conference, INOC 2005. Eds. L. Gouveia and C. Mourao, University of Lisbon, Portugal.
Peter Broström and Kaj Holmberg. Determining the Non-Existence of Compatible OSPF Weights. Proceedings of the Ninth Meeting of the Nordic Section of the Mathematical Programming Society, (2004). Ed. Di Yuan, Linköping University, Norrköping, Sweden.
Kaj Holmberg and Krzysztof Kiwiel. Parallel Mean Value Cross Decomposition for Nonlinear Convex Problems. Proceedings of the Eighth Meeting of the Nordic Section of the Mathematical Programming Society, 2002. Eds. D. Haugland and S.C. Ho, Bergen University, Norway.
Kaj Holmberg and Di Yuan. Optimal Network Design and Routing for IP Traffic. Proceedings of the Third International Workshop on Design of Reliable Communication Networks. Ed. T. Cinkler. Budapest, Hungary, 2001.
Kaj Holmberg, Mathias Henningsson and Mikael Näsberg. A Capacitated Bus Grid Network Design Problem. Proceedings of 8th International Conference on Telecommunication Systems. Ed. B. Gavish. Vanderbilt University, USA, 2000.
Kaj Holmberg, Martin Joborn, and Kennet Melin. A Lagrangean Heuristic for the Multicommodity Network Flow Problem with Fixed Path Costs. Proceedings of the Sixth Meeting of the Nordic Section of the Mathematical Programming Society, 1999. Eds. E. Dotzauser, M. Björkman and K. Holmström, Mälardalen University, Västerås, Sweden.
Kaj Holmberg. Mean Value Cross Decomposition Based Branch-and-Bound for Mixed Integer Programming Problems. Operations Research Proceedings 1998, Selected Papers of the International Conference on Operations Research (OR 98). Eds. P. Kall and H.-J. Lüthi. Springer, 1999.
Kaj Holmberg and Di Yuan. On Extended Models of Multicommodity Routing with Side Constraints on Paths. Operations Research Proceedings 1998, Selected Papers of the International Conference on Operations Research (OR 98). Eds. P. Kall and H.-J. Lüthi. Springer, 1999.
Kaj Holmberg, Mathias Henningsson and Mikael Rönnqvist and Peter Värbrand. A Ring Network Design Problem. Operations Research Proceedings 1998, Selected Papers of the International Conference on Operations Research (OR 98). Eds. P. Kall and H.-J. Lüthi. Springer, 1999.
Kaj Holmberg and Di Yuan. A Multicommodity Network Flow Problem with Side Constraints on Paths Solved by Column Generation. Proceedings of the Fifth Meeting of the Nordic Section of the Mathematical Programming Society, 1998. Ed. A. Lokketangen, Molde College, Norway.
Kaj Holmberg. Mean Value Cross Decomposition Based Branch-and-Bound for Mixed Integer Programming Problems. Proceedings of the Fifth Meeting of the Nordic Section of the Mathematical Programming Society, 1998. Ed. A. Lokketangen, Molde College, Norway.
Kaj Holmberg and Di Yuan. A Lagrangean Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem. Operations Research Proceedings 1996, Selected Papers of the Symposium on Operations Research (SOR 96). Eds. U. Zimmermann, U. Derigs, W. Gaul, R.H. Möhring and K.-P. Schuster. Springer, 1997.
Kaj Holmberg and Di Yuan. A Lagrangean Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem. Proceedings of the Fourth Meeting of the Nordic Section of the Mathematical Programming Society, 1996. Ed. K.A. Andersen, University of Aarhus, Denmark.
Kaj Holmberg, Mathias Henningsson and Mikael Näsberg. A Capaciatated Bus Grid Network Design Problem. Proceedings of the Fourth Meeting of the Nordic Section of the Mathematical Programming Society, 1996. Ed. K.A. Andersen, University of Aarhus, Denmark.
Kaj Holmberg, Mikael Rönnqvist and Di Yuan. Solving Capacitated Facility Location Problems with Single Sourcing Using Lagrangean Heuristics, Repeated Matching and Branch-and-Bound. Proceedings of the Fourth Meeting of the Nordic Section of the Mathematical Programming Society, 1996. Ed. K.A. Andersen, University of Aarhus, Denmark.
Kaj Holmberg, Martin Joborn, and Jan Lundgren. Computational Experiments with an Empty Freight Car Distribution Model. In: Computers in Railways V - Volume 1: Railway Systems and Management, 1996. Eds. J. Allan, C.A. Brebbia, R.J. Hill, G. Sciutto and S. Sone. Computational Mechanics Publications, Southampton, UK.
Kaj Holmberg and Kurt Jörnsten. The Simple Plant Location Problem with Spatial Interaction: Formulation and Solution Methods. Operations Research Proceedings 1995, Selected Papers of the Symposium on Operations Research (SOR'95). Eds. P. Kleinschmidt, A. Bachem, U. Derigs, D. Fischer, U. Leopold-Wildburger and R. Möhring. Springer, 1995.
Kaj Holmberg and Jonas Ling. A Lagrangean Heuristic for the Facility Location Problem with Staircase Costs. Operations Research Proceedings 1995, Selected Papers of the Symposium on Operations Research (SOR'95). Eds. P. Kleinschmidt, A. Bachem, U. Derigs, D. Fischer, U. Leopold-Wildburger and R. Möhring. Springer, 1995.
Kaj Holmberg, Martin Joborn, and Jan Lundgren. A model for allocation of empty freight cars with capacity restrictions and fixed costs. In T.K.S. Murthy, B. Mellitt, C.A. Brebbia, G. Sciutto, and S. Sone, editors, Computers in Railways IV - Vol 1: Railway Design and Management, Southampton, 1994. Computational Mechanics Publications.
Kaj Holmberg, Martin Joborn, and Jan Lundgren. Models for allocation of empty freight cars. In Kaj Holmberg, editor, Proceedings of the Third Meeting of the Nordic Section of the Mathematical Programming Society. Linkoping Institute of Technology, 1994.
Kaj Holmberg. Efficient decomposition and linearization methods for the stochastic transportation problem. In Kaj Holmberg, editor, Proceedings of the Third Meeting of the Nordic Section of the Mathematical Programming Society. Linkoping Institute of Technology, 1994.
Kaj Holmberg and Hoang Tuy. A production-transportation problem with stochastic demand and concave production costs. In A. Bachem, U. Derigs, M. Junger, and R. Schrader, editors, Operations Research '93. GMOOR, 1994.
Kaj Holmberg. Linear mean value cross decomposition I: A convergence proof. In Proceedings of the First Nordic MPS Meeting, Copenhagen, Denmark, 1990.
Kaj Holmberg and Kurt Jörnsten. An exact formulation of the simple plant location problem with spatial interaction. In Fr. Orban-Ferauge and J.P. Rasson, editors, Proceedings of meeting V of the EURO Working Group on Locational Analysis, Namur, Belgium, 1990. Faculte Universitaires Notre-Dame de-la-Paix.