# Kaj Holmberg

According to our database

Collaborative distances:

^{1}, Kaj Holmberg authored at least 40 papers between 1990 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Networks, 2020

2019

Transp. Sci., 2019

J. Oper. Res. Soc., 2019

2013

Military aircraft mission planning: a generalized vehicle routing model with synchronization and precedence.

EURO J. Transp. Logist., 2013

2011

Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

Proceedings of the Network Optimization - 5th International Conference, 2011

2010

J. Glob. Optim., 2010

Int. J. Robotics Res., 2010

Comput. Oper. Res., 2010

Proceedings of the 11th International Conference on Control, 2010

Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Telecommun. Syst., 2009

Graph Optimization Approaches for Minimal Rerouting in Symmetric Three Stage Clos Networks.

J. Math. Model. Algorithms, 2009

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

2008

Networks, 2008

Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths.

Eur. J. Oper. Res., 2008

2006

Optim. Methods Softw., 2006

Ann. Oper. Res., 2006

Proceedings of the Handbook of Optimization in Telecommunications, 2006

2004

Transp. Sci., 2004

Networks, 2004

Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives.

Eur. J. Oper. Res., 2004

2003

A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation.

INFORMS J. Comput., 2003

2002

Telecommun. Syst., 2002

2000

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

Oper. Res., 2000

1999

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

1998

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

1995

Efficient decomposition and linearization methods for the stochastic transportation problem.

Comput. Optim. Appl., 1995

1994

Math. Methods Oper. Res., 1994

Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts.

Oper. Res., 1994

1990

Math. Program., 1990