Kaj Holmberg

41 papers C 2Journal 30Unranked 3
YearRankTypeTitle / Venue / Authors
2020 J jnl
A branch-and-dive heuristic for single vehicle snow removal.
Networks
Roghayeh Hajizadeh, Kaj Holmberg
2019 J jnl
Formation of student groups with the help of optimisation.
J. Oper. Res. Soc.
Kaj Holmberg
2019 J jnl
The (Over)zealous Snow Remover Problem.
Transp. Sci.
Kaj Holmberg
2013 J jnl
Military aircraft mission planning: a generalized vehicle routing model with synchronization and precedence.
EURO J. Transp. Logist.
Nils-Hassan Quttineh, Torbjörn Larsson, Kristian Lundberg, Kaj Holmberg
2011 C conf
Complexity of Inverse Shortest Path Routing.
INOC
Mikael Call, Kaj Holmberg
2011 — conf
Inverse Shortest Path Models Based on Fundamental Cycle Bases.
OR
Mikael Call, Kaj Holmberg
2010 C conf
Generating UAV communication networks for monitoring and surveillance.
ICARCV
Per-Magnus Olsson, Jonas Kvarnström, Patrick Doherty, Oleg Burdakov, Kaj Holmberg
2010 J jnl
Heuristics for the rural postman problem.
Comput. Oper. Res.
Kaj Holmberg
2010 J jnl
Optimal placement of UV-based communications relay nodes.
J. Glob. Optim.
Oleg Burdakov, Patrick Doherty, Kaj Holmberg, Per-Magnus Olsson
2010 — ch.
Optimization of OSPF Routing in IP Networks.
Graphs and Algorithms in Communication Networks
Andreas Bley, Bernard Fortz, Éric Gourdin, Kaj Holmberg, Olivier Klopfenstein, Michal Pióro, Artur Tomaszewski, Hakan Ümit
2010 J jnl
Relay Positioning for Unmanned Aerial Vehicle Surveillance.
Int. J. Robotics Res.
Oleg Burdakov, Patrick Doherty, Kaj Holmberg, Jonas Kvarnström, Per-Magnus Olsson
2009 J jnl
Compatible Weights and Valid Cycles in Non-spanning OSPF Routing Patterns.
Algorithmic Oper. Res.
Peter Broström, Kaj Holmberg
2009 J jnl
Design of OSPF networks using subpath consistent routing patterns.
Telecommun. Syst.
Peter Broström, Kaj Holmberg
2009 — ch.
Facility Location Problems with Spatial Interaction.
Encyclopedia of Optimization
Kaj Holmberg
2009 — ch.
Facility Location with Staircase Costs.
Encyclopedia of Optimization
Kaj Holmberg
2009 J jnl
Graph Optimization Approaches for Minimal Rerouting in Symmetric Three Stage Clos Networks.
J. Math. Model. Algorithms
Kaj Holmberg
2009 — ch.
MINLP: Generalized Cross Decomposition.
Encyclopedia of Optimization
Kaj Holmberg
2009 — conf
Positioning unmanned aerial vehicles as communication relays for surveillance tasks.
Robotics: Science and Systems
Oleg Burdakov, Patrick Doherty, Kaj Holmberg, Jonas Kvarnström, Per-Magnus Olsson
2009 — ch.
Stochastic Transportation and Location Problems.
Encyclopedia of Optimization
Kaj Holmberg
2008 J jnl
Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths.
Eur. J. Oper. Res.
Kaj Holmberg, Martin Joborn, Kennet Melin
2008 J jnl
Valid cycles: A source of infeasibility in open shortest path first routing.
Networks
Peter Broström, Kaj Holmberg
2006 J jnl
Mean value cross decomposition for nonlinear convex problems.
Optim. Methods Softw.
Kaj Holmberg, Krzysztof C. Kiwiel
2006 J jnl
Multiobjective design of survivable IP networks.
Ann. Oper. Res.
Peter Broström, Kaj Holmberg
2006 — ch.
Ring Network Design.
Handbook of Optimization in Telecommunications
Mathias Henningsson, Kaj Holmberg, Di Yuan
2004 J jnl
Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives.
Eur. J. Oper. Res.
Anders J. V. Skriver, Kim Allan Andersen, Kaj Holmberg
2004 J jnl
Economies of Scale in Empty Freight Car Distribution in Scheduled Railways.
Transp. Sci.
Martin Joborn, Teodor Gabriel Crainic, Michel Gendreau, Kaj Holmberg, Jan T. Lundgren
2004 J jnl
Optimization of Internet Protocol network design and routing.
Networks
Kaj Holmberg, Di Yuan
2003 J jnl
A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation.
INFORMS J. Comput.
Kaj Holmberg, Di Yuan
2002 J jnl
Ring Network Design by Lagrangean Based Column Generation.
Telecommun. Syst.
Mathias Henningsson, Kaj Holmberg, Mikael Rönnqvist, Peter Värbrand
2001 — conf
Optimal Network Design and Routing for IP Traffic.
DRCN
Kaj Holmberg, Di Yuan
2000 J jnl
A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem.
Oper. Res.
Kaj Holmberg, Di Yuan
1999 J jnl
A production-transportation problem with stochastic demand and concave production costs.
Math. Program.
Kaj Holmberg, Hoang Tuy
1999 J jnl
An exact algorithm for the capacitated facility location problems with single sourcing.
Eur. J. Oper. Res.
Kaj Holmberg, Mikael Rönnqvist, Di Yuan
1999 J jnl
Exact solution methods for uncapacitated location problems with convex transportation costs.
Eur. J. Oper. Res.
Kaj Holmberg
1998 J jnl
Creative modeling: Variable and constraint duplicationin primal - dual decomposition methods.
Ann. Oper. Res.
Kaj Holmberg
1998 J jnl
Improved Empty Freight Car Distribution.
Transp. Sci.
Kaj Holmberg, Martin Joborn, Jan T. Lundgren
1998 J jnl
Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound.
Oper. Res.
Kaj Holmberg, Johan Hellstrand
1995 J jnl
Efficient decomposition and linearization methods for the stochastic transportation problem.
Comput. Optim. Appl.
Kaj Holmberg
1994 J jnl
A convergence proof for linear mean value cross decomposition.
Math. Methods Oper. Res.
Kaj Holmberg
1994 J jnl
Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts.
Oper. Res.
Kaj Holmberg
1990 J jnl
On the Convergence of Cross Decomposition.
Math. Program.
Kaj Holmberg