default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKaj Holmberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j30]Roghayeh Hajizadeh
, Kaj Holmberg:
A branch-and-dive heuristic for single vehicle snow removal. Networks 76(4): 509-521 (2020)
2010 – 2019
- 2019
- [j29]Kaj Holmberg:
Formation of student groups with the help of optimisation. J. Oper. Res. Soc. 70(9): 1538-1553 (2019) - [j28]Kaj Holmberg:
The (Over)zealous Snow Remover Problem. Transp. Sci. 53(3): 867-881 (2019) - 2013
- [j27]Nils-Hassan Quttineh, Torbjörn Larsson, Kristian Lundberg, Kaj Holmberg:
Military aircraft mission planning: a generalized vehicle routing model with synchronization and precedence. EURO J. Transp. Logist. 2(1-2): 109-127 (2013) - 2011
- [c5]Mikael Call, Kaj Holmberg:
Complexity of Inverse Shortest Path Routing. INOC 2011: 339-353 - [c4]Mikael Call, Kaj Holmberg:
Inverse Shortest Path Models Based on Fundamental Cycle Bases. OR 2011: 77-82 - 2010
- [j26]Kaj Holmberg:
Heuristics for the rural postman problem. Comput. Oper. Res. 37(5): 981-990 (2010) - [j25]Oleg Burdakov, Patrick Doherty, Kaj Holmberg, Jonas Kvarnström, Per-Magnus Olsson:
Relay Positioning for Unmanned Aerial Vehicle Surveillance. Int. J. Robotics Res. 29(8): 1069-1087 (2010) - [j24]Oleg Burdakov, Patrick Doherty, Kaj Holmberg, Per-Magnus Olsson:
Optimal placement of UV-based communications relay nodes. J. Glob. Optim. 48(4): 511-531 (2010) - [c3]Per-Magnus Olsson, Jonas Kvarnström, Patrick Doherty, Oleg Burdakov, Kaj Holmberg:
Generating UAV communication networks for monitoring and surveillance. ICARCV 2010: 1070-1077 - [p2]Andreas Bley, Bernard Fortz, Éric Gourdin, Kaj Holmberg, Olivier Klopfenstein, Michal Pióro, Artur Tomaszewski, Hakan Ümit:
Optimization of OSPF Routing in IP Networks. Graphs and Algorithms in Communication Networks 2010: 199-240
2000 – 2009
- 2009
- [j23]Peter Broström, Kaj Holmberg:
Compatible Weights and Valid Cycles in Non-spanning OSPF Routing Patterns. Algorithmic Oper. Res. 4(1): 19-35 (2009) - [j22]Kaj Holmberg:
Graph Optimization Approaches for Minimal Rerouting in Symmetric Three Stage Clos Networks. J. Math. Model. Algorithms 8(1): 81-100 (2009) - [j21]Peter Broström, Kaj Holmberg:
Design of OSPF networks using subpath consistent routing patterns. Telecommun. Syst. 41(4): 293-309 (2009) - [c2]Oleg Burdakov, Patrick Doherty, Kaj Holmberg, Jonas Kvarnström, Per-Magnus Olsson:
Positioning unmanned aerial vehicles as communication relays for surveillance tasks. Robotics: Science and Systems 2009 - [r4]Kaj Holmberg:
Facility Location Problems with Spatial Interaction. Encyclopedia of Optimization 2009: 982-989 - [r3]Kaj Holmberg:
Facility Location with Staircase Costs. Encyclopedia of Optimization 2009: 989-995 - [r2]Kaj Holmberg:
MINLP: Generalized Cross Decomposition. Encyclopedia of Optimization 2009: 2148-2155 - [r1]Kaj Holmberg:
Stochastic Transportation and Location Problems. Encyclopedia of Optimization 2009: 3824-3829 - 2008
- [j20]Kaj Holmberg, Martin Joborn, Kennet Melin:
Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths. Eur. J. Oper. Res. 188(1): 101-108 (2008) - [j19]Peter Broström, Kaj Holmberg:
Valid cycles: A source of infeasibility in open shortest path first routing. Networks 52(4): 206-215 (2008) - 2006
- [j18]Peter Broström, Kaj Holmberg:
Multiobjective design of survivable IP networks. Ann. Oper. Res. 147(1): 235-253 (2006) - [j17]Kaj Holmberg, Krzysztof C. Kiwiel:
Mean value cross decomposition for nonlinear convex problems. Optim. Methods Softw. 21(3): 401-417 (2006) - [p1]Mathias Henningsson, Kaj Holmberg, Di Yuan:
Ring Network Design. Handbook of Optimization in Telecommunications 2006: 291-311 - 2004
- [j16]Anders J. V. Skriver, Kim Allan Andersen, Kaj Holmberg:
Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives. Eur. J. Oper. Res. 156(3): 541-549 (2004) - [j15]Kaj Holmberg, Di Yuan:
Optimization of Internet Protocol network design and routing. Networks 43(1): 39-53 (2004) - [j14]Martin Joborn, Teodor Gabriel Crainic, Michel Gendreau, Kaj Holmberg, Jan T. Lundgren:
Economies of Scale in Empty Freight Car Distribution in Scheduled Railways. Transp. Sci. 38(2): 121-134 (2004) - 2003
- [j13]Kaj Holmberg, Di Yuan:
A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation. INFORMS J. Comput. 15(1): 42-57 (2003) - 2002
- [j12]Mathias Henningsson, Kaj Holmberg, Mikael Rönnqvist, Peter Värbrand:
Ring Network Design by Lagrangean Based Column Generation. Telecommun. Syst. 21(2): 301-318 (2002) - 2001
- [c1]Kaj Holmberg, Di Yuan:
Optimal Network Design and Routing for IP Traffic. DRCN 2001: 310-316 - 2000
- [j11]Kaj Holmberg, Di Yuan:
A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem. Oper. Res. 48(3): 461-481 (2000)
1990 – 1999
- 1999
- [j10]Kaj Holmberg, Mikael Rönnqvist, Di Yuan:
An exact algorithm for the capacitated facility location problems with single sourcing. Eur. J. Oper. Res. 113(3): 544-559 (1999) - [j9]Kaj Holmberg:
Exact solution methods for uncapacitated location problems with convex transportation costs. Eur. J. Oper. Res. 114(1): 127-140 (1999) - [j8]Kaj Holmberg, Hoang Tuy:
A production-transportation problem with stochastic demand and concave production costs. Math. Program. 85(1): 157-179 (1999) - 1998
- [j7]Kaj Holmberg:
Creative modeling: Variable and constraint duplicationin primal - dual decomposition methods. Ann. Oper. Res. 82: 355-390 (1998) - [j6]Kaj Holmberg, Johan Hellstrand:
Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound. Oper. Res. 46(2): 247-259 (1998) - [j5]Kaj Holmberg, Martin Joborn, Jan T. Lundgren:
Improved Empty Freight Car Distribution. Transp. Sci. 32(2): 163-173 (1998) - 1995
- [j4]Kaj Holmberg:
Efficient decomposition and linearization methods for the stochastic transportation problem. Comput. Optim. Appl. 4(4): 293-316 (1995) - 1994
- [j3]Kaj Holmberg:
Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts. Oper. Res. 42(4): 657-668 (1994) - [j2]Kaj Holmberg:
A convergence proof for linear mean value cross decomposition. Math. Methods Oper. Res. 39(2): 157-186 (1994) - 1990
- [j1]Kaj Holmberg:
On the Convergence of Cross Decomposition. Math. Program. 47: 269-296 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
