Kaj Holmberg

According to our database1, Kaj Holmberg authored at least 40 papers between 1990 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


On csauthors.net:


A branch-and-dive heuristic for single vehicle snow removal.
Networks, 2020

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

Formation of student groups with the help of optimisation.
J. Oper. Res. Soc., 2019

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

Inverse Shortest Path Models Based on Fundamental Cycle Bases.
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

Complexity of Inverse Shortest Path Routing.
Proceedings of the Network Optimization - 5th International Conference, 2011

Optimal placement of UV-based communications relay nodes.
J. Glob. Optim., 2010

Relay Positioning for Unmanned Aerial Vehicle Surveillance.
Int. J. Robotics Res., 2010

Heuristics for the rural postman problem.
Comput. Oper. Res., 2010

Generating UAV communication networks for monitoring and surveillance.
Proceedings of the 11th International Conference on Control, 2010

Optimization of OSPF Routing in IP Networks.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

Stochastic Transportation and Location Problems.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

MINLP: Generalized Cross Decomposition.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Facility Location with Staircase Costs.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Facility Location Problems with Spatial Interaction.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Design of OSPF networks using subpath consistent routing patterns.
Telecommun. Syst., 2009

Graph Optimization Approaches for Minimal Rerouting in Symmetric Three Stage Clos Networks.
J. Math. Model. Algorithms, 2009

Compatible Weights and Valid Cycles in Non-spanning OSPF Routing Patterns.
Algorithmic Oper. Res., 2009

Positioning unmanned aerial vehicles as communication relays for surveillance tasks.
Proceedings of the Robotics: Science and Systems V, University of Washington, Seattle, USA, June 28, 2009

Valid cycles: A source of infeasibility in open shortest path first routing.
Networks, 2008

Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths.
Eur. J. Oper. Res., 2008

Mean value cross decomposition for nonlinear convex problems.
Optim. Methods Softw., 2006

Multiobjective design of survivable IP networks.
Ann. Oper. Res., 2006

Ring Network Design.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

Economies of Scale in Empty Freight Car Distribution in Scheduled Railways.
Transp. Sci., 2004

Optimization of Internet Protocol network design and routing.
Networks, 2004

Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives.
Eur. J. Oper. Res., 2004

A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation.
INFORMS J. Comput., 2003

Ring Network Design by Lagrangean Based Column Generation.
Telecommun. Syst., 2002

A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem.
Oper. Res., 2000

A production-transportation problem with stochastic demand and concave production costs.
Math. Program., 1999

An exact algorithm for the capacitated facility location problems with single sourcing.
Eur. J. Oper. Res., 1999

Exact solution methods for uncapacitated location problems with convex transportation costs.
Eur. J. Oper. Res., 1999

Improved Empty Freight Car Distribution.
Transp. Sci., 1998

Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound.
Oper. Res., 1998

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

Efficient decomposition and linearization methods for the stochastic transportation problem.
Comput. Optim. Appl., 1995

A convergence proof for linear mean value cross decomposition.
Math. Methods Oper. Res., 1994

Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts.
Oper. Res., 1994

On the Convergence of Cross Decomposition.
Math. Program., 1990