Publications for Kaj Holmberg
Co-author map based on ISI articles 2007-

Keywords

traffic telecommunication shortest routing rings ring relay paths path ospf nodes model links heuristic fixed dual constraints connected computational chains

Journal Articles

Nils-Hassan Quttineh, Torbjörn Larsson, Kristian Lundberg and Kaj Holmberg
  Military aircraft mission planning: a generalized vehicle routing model with synchronization and precedence
  EURO Journal on Transportation and Logistics, 2013, 2(1-2), 109-127.

Oleg Burdakov, Patrick Doherty, Kaj Holmberg and Per-Magnus Olsson
  Optimal placement of UV-based communications relay nodes
  Journal of Global Optimization, 2010, 48(4), 511-531.
   Fulltext  PDF  
 Web of Science® Times Cited: 9

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, 2010, 29(8), 1069-1087.
 Web of Science® Times Cited: 6

Kaj Holmberg
  Heuristics for the rural postman problem
  Computers & Operations Research, 2010, 37(5), 981-990.
 Web of Science® Times Cited: 2

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

Peter Brostrom and Kaj Holmberg
  Design of OSPF networks using subpath consistent routing patterns
  TELECOMMUNICATION SYSTEMS, 2009, 41(4), 293-309.
   Fulltext  PDF  

Kaj Holmberg
  Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks
  Journal of Mathematical Modelling and Algorithms, 2009, 8(1), 81-100.
   Fulltext  PDF  

Peter Broström and Kaj Holmberg
  Valid Cycles: A Source of Infeasibility in Open Shortest Path First Routing
  Networks, 2008, 52(4), 206-215.
 Web of Science® Times Cited: 8

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, 2008, 188(1), 101-108.
 Web of Science® Times Cited: 4

Kaj Holmberg
  Optmization Models for Routing in Switching Networks of Clos Type with many Stages
  Advanced modeling and optimization, 2008, 10(1), .

Peter Broström and Kaj Holmberg
  On the Extremal Structure of an OSPF Related Cone
  Vietnam journal of mathematics, 2007, 35, 507-522.

Peter Broström and Kaj Holmberg
  Multiobjective design of survivable IP networks
  Annals of Operations Research, 2006, 147(1), 235-253.
 Web of Science® Times Cited: 4

Kaj Holmberg and Krzysztof Kiwiel
  Mean Value Cross Decomposition for Nonlinear Convex Problems
  Optimization Methods and Software, 2006, 21, 401-417.
 Web of Science® Times Cited: 11

M. Joborn, T.G. Crainic, M. Gendreau, Kaj Holmberg and Jan Lundgren
  Economies of scale in empty freight car distribution in scheduled railways
  Transportation Science, 2004, 38(2), 121-134.
 Web of Science® Times Cited: 13

A.J.V. Skriver, K.A. Andersen and Kaj Holmberg
  Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives
  European Journal of Operational Research, 2004, 156(3), 541-549.
 Web of Science® Times Cited: 2

Kaj Holmberg and Di Yuan
  Optimization of Internet Protocol Network Design and Routing
  Networks, 2004, 43(1), 39-53.
 Web of Science® Times Cited: 29

Kaj Holmberg and Di Yuan
  A multicommodity network-flow problem with side constraints on paths solved by column generation
  INFORMS journal on computing, 2003, 15(1), 42-57.
 Web of Science® Times Cited: 19

Mathias Henningsson, Kaj Holmberg, Mikael Rönnqvist and Peter Värbrand
  Ring network design by Lagrangean based column generation
  Telecommunications Systems, 2002, 21(2-4), 301-318.
 Web of Science® Times Cited: 2

Kaj Holmberg
  Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
  Optimization, 2001, 49(5-6), 495-516.
 Web of Science® Times Cited: 4

Kaj Holmberg and Di Yuan
  A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem
  Operations Research, 2000, 48(3), 461-481.
 Web of Science® Times Cited: 71

Books

Kaj Holmberg
  Optimering
    Liber, 2010.


Chapters in Books

Mikael Call and Kaj Holmberg
  Inverse Shortest Path Models Based on Fundamental Cycle Bases
  Operations Research Proceedings 2011: Selected Papers of the International Conference on Operations Research (OR 2011), August 30 - September 2, 2011, Zurich, Switzerland, Springer Berlin/Heidelberg, 2012, 77-82.


Kaj Holmberg and Mikael Call
  Complexity of Inverse Shortest Path Routing
  Network Optimization: 5th International Conference, INOC 2011, Springer Berlin/Heidelberg, 2011, 339-353.


Kaj Holmberg
  Optimization of OSPF Routing in IP Networks
  Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless and Ad Hoc Networks, Springer Berlin/Heidelberg, 2010, .


Mathias Henningsson, Kaj Holmberg and Di Yuan
  Ring Network Design
  Handbook of Optimization in Telecommunications, Springer Science + Business Media, 2006, 291-312.


Conference Articles

Nils-Hassan Quttineh, Torbjörn Larsson, Kristian Lundberg and Kaj Holmberg
  Effect Oriented Planning of Joint Attacks
  Optimization Theory, Decision Making, and Operations Research Applications, 2013.


Per-Magnus Olsson, Jonas Kvarnström, Patrick Doherty, Oleg Burdakov and Kaj Holmberg
  Generating UAV Communication Networks for Monitoring and Surveillance
  Proceedings of the 11th International Conference on Control, Automation, Robotics and Vision (ICARCV 2010), 2010.


 Web of Science® Times Cited: 2

Oleg Burdakov, Patrick Doherty, Kaj Holmberg, Jonas Kvarnström and Per-Magnus Olsson
  Positioning Unmanned Aerial Vehicles As Communication Relays for Surveillance Tasks
  Robotics: Science and Systems V, 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.


  Fulltext PDF

Kaj Holmberg and Peter Broström
  Design of IP/OSPF Networks Using a Lagrangean Heuristic on an In-graph Based Model
  Proceedings of the International Network Optimization Conference, INOC 2005, 2005.


Kaj Holmberg and Peter Broström
  Determining the Non-Existence of a Compatible OSPF Metric
  International Network Optimization Conference, INOC 2005,2005, 2005.


Kaj Holmberg and Peter Broström
  Stronger Necessary Conditions for the Existence of a Compatible OSPF Metric
  Nordic MPS 04,2004, 2004.


Peter Broström and Kaj Holmberg
  Determining the Non-Existence of a Compatible OSPF Metric
  Nordic MPS 2004,2004, 2004.


Kaj Holmberg
  Mean Value Cross Decomposition for Nonlinear Convex Problems
  18th International Symposium on Mathematical Programming,2003, 2003.


Peter Broström and Kaj Holmberg
  Internet Protocol Network Design and Routing
  18th International Symposium on Mathematical Programming,2003, 2003.


Ph.D. Theses

Per-Magnus Olsson
  Methods for Network Optimization and Parallel Derivative-free Optimization
  2014.


  Fulltext PDF

Mikael Call
  Shortest Path Routing Modelling, Infeasibility and Polyhedra
  2012.


  Fulltext PDF

Nils-Hassan Quttineh
  Models and Methods for Costly Global Optimization and Military Decision Support Systems
  2012.


  Fulltext PDF

Licentiate Theses

Kristian Lundberg
  Effect Oriented Planning in Military Mission Support Systems: Models and Heuristic Approaches
  2013.


Mikael Call
  Inverse Shortest Path Routing Problems in the Design of IP Networks
  2010.


  Fulltext PDF

Reports

Kaj Holmberg
  Formation of Student Groups with the Help of Optimization
  LiTH-MAT-R, 2014:14, 2014.


  Fulltext PDF

Kaj Holmberg
  Urban Snow Removal:: Modeling and Relaxations
  LiTH-MAT-R, 2014:08, 2014.


  Fulltext PDF

Nils-Hassan Quttineh, Kristian Lundberg, Kaj Holmberg and Torbjörn Larsson
  Aircraft Mission Planning
  LiTH-MAT-R, 2012:7, 2012.


Nils-Hassan Quttineh, Kristian Lundberg, Kaj Holmberg and Torbjörn Larsson
  Effect Oriented Planning
  LiTH-MAT-R, 2012:6, 2012.


Oleg Burdakov, Kaj Holmberg, Patrick Doherty and Per-Magnus Olsson
  Optimal placement of communications relay nodes
  LiTH-MAT-R, 2009:3, 2009.


Oleg Burdakov, Kaj Holmberg and Per-Magnus Olsson
  A Dual Ascent Method for the Hop-constrained Shortest Path with Application to Positioning of Unmanned Aerial Vehicles
  Report / Department of Mathematics, Universitetet i Linköping, Tekniska högskolan, 2008:7, 2008.


Kaj Holmberg
  Heuristics for the Rural Postman Problem with Application to Snow Removal for Secondary Roads
  LiTH-MAT-R, 2008:14, 2008.


Kaj Holmberg
  Graph Optimization Approaches for Minimal Rerouting in Symmetric Three Stage Clos Networks
  LiTH-MAT-R, 2007:12, 2007.


Peter Broström and Kaj Holmberg
  Compatible Weights and Valid Cycles in Non-spanning OSPF Routing Patterns
  LiTH-MAT-R, 4, 2007.


Peter Broström and Kaj Holmberg
  Design of OSPF Networks using Subpath Consistent Routing Patterns
  LiTH-MAT-R, 5, 2007.


Peter Broström and Kaj Holmberg
  On the Extremal Structure of an OSPF Related Cone
  LiTH-MAT-R, 2006:2, 2006.


Peter Broström and Kaj Holmberg
  A new derivation of valid cycles
  2005.


Kaj Holmberg, Martin Joborn and Kennet Melin
  Lagrangian Based Heuristics for the Multicommodity Network Flow Problem with Fixed Costs On Paths
  LiTH-MAT-R, 15, 2004.


Kaj Holmberg
  Mean Value Cross Decomposition Based Branch-and-Bound for Mixed Integer Programming Problems
  LiTH-MAT-R, 13, 2004.


Peter Broström and Kaj Holmberg
  Multiobjective design of survivable IP networks
  LiTH-MAT-R, 3, 2004.


Peter Broström and Kaj Holmberg
  Determining the Non-Existence of a Compatible OSPF Metric
  LiTH-MAT-R, 6, 2004.


Peter Broström and Kaj Holmberg
  Stronger Necessary Conditions for the Existence of a Compatible OSPF Metric
  LiTH-MAT-R, 8, 2004.


Kaj Holmberg and Krzysztof Kiwiel
  Mean Value Cross Decomposition for Nonlinear Convex Problems
  LiTH-MAT-R, 10, 2003.


Mathias Henningsson and Kaj Holmberg
  Lagrangean price directive ring generation for network design
  LiTH-MAT-R, 17, 2003.


Mathias Henningsson and Kaj Holmberg
  A ring generation problem based on the traveling salesman subtour problem
  LiTH-MAT-R, 19, 2003.


Mathias Henningsson and Kaj Holmberg
  Calculating cost coefficients for generation of rings in network design
  LiTH-MAT-R, 18, 2003.


Mathias Henningsson, Kaj Holmberg, Mikael Rönnqvist and Peter Värbrand
  A ring network design problem and heuristics for generating a set of feasible rings
  LiTH-MAT-R, 16, 2003.


Mathias Henningsson, Kaj Holmberg, Mikael Rönnqvist and Peter Värbrand
  A ring network design problem solved by a ring generation and allocation approach
  LiTH-MAT-R, 20, 2003.


Mathias Henningsson, Kaj Holmberg, Mikael Rönnqvist and Peter Värbrand
  A column generation approach for a ring network design problem
  LiTH-MAT-R, 21, 2003.