Holmberg Kaj

Kaj Holmberg

Information about the author Kaj Holmberg will soon be added to the site.
Found 23 papers in total
Optimal placement of UV-based communications relay nodes
Optimal placement of UV-based communications relay nodes
2010
We consider a constrained optimization problem with mixed integer and real variables....
Compatible weights and valid cycles in non-spanning OSPF (open shortest path first) routing patterns
Compatible weights and valid cycles in non-spanning OSPF (open shortest path first) routing patterns
2009
Many IP (Internet Protocol) networks use OSPF (Open Shortest Path First) for...
Multiobjective design of survivable Internet Protocol networks
Multiobjective design of survivable Internet Protocol networks
2006
Modern communication networks often use Internet Protocol routing and the intra-domain...
Economies of scale in empty freight car distribution in scheduled railways
Economies of scale in empty freight car distribution in scheduled railways
2004
In this paper, we consider empty freight car distribution in a scheduled railway...
Bicriteria network location problems with criteria dependent lengths and minisum objectives
Bicriteria network location problems with criteria dependent lengths and minisum objectives
2004
We present a new location model, which is a generalization of the bicriteria median...
Optimization of Internet Protocol network design and routing
Optimization of Internet Protocol network design and routing
2004
We consider network design and routing for Internet Protocol (IP) traffic. The design...
A multicommodity network-flow problem with side constraints on paths solved by column generation
A multicommodity network-flow problem with side constraints on paths solved by column generation
2003
The multicommodity network-flow model concerns routing of a number of commodities...
A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem
A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem
2000
The capacitated network design problem is a multicommodity minimal cost network flow...
A Lagrangean approach to network design problems
A Lagrangean approach to network design problems
1998
Network design is a very important issue in the area of telecommunications and...
A production–transportation problem with stochastic demand and concave production costs
A production–transportation problem with stochastic demand and concave production costs
1999
Well known extensions of the classical transportation problem are obtained by...
Exact solution methods for uncapacitated location problems with convex transportation costs
Exact solution methods for uncapacitated location problems with convex transportation costs
1999
In this paper we study exact solution methods for uncapacitated facility location...
An exact algorithm for the capacitated facility location problems with single sourcing
An exact algorithm for the capacitated facility location problems with single sourcing
1999
Facility location problems are often encountered in many areas such as distribution,...
Mean value cross decomposition applied to integer programming problems
Mean value cross decomposition applied to integer programming problems
1997
The mean value cross decomposition method for linear programming problems is a...
Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
1998
The network design problem is a multicommodity minimal cost network flow problem with...
Creative modeling: Variable and constraint duplication in primal–dual decomposition methods
Creative modeling: Variable and constraint duplication in primal–dual decomposition methods
1998
In this paper, we discuss modeling with the specific purpose of solving the models...
A Lagrangean heuristic for the facility location problem with staircase costs
A Lagrangean heuristic for the facility location problem with staircase costs
1997
In this paper we develop and compare heuristic solution methods for the capacitated...
On using approximations of the Benders master problem
On using approximations of the Benders master problem
1994
In this paper we study some approximate ways of solving the Benders master problem in...
Solving the staircase cost facility location problem with decomposition and piecewise linearization
Solving the staircase cost facility location problem with decomposition and piecewise linearization
1994
Facility location problems with staircase costs, i.e. fixed costs that appear at...
Dual search procedures for the exact formulation of the simple plant location problem with spatial interaction
Dual search procedures for the exact formulation of the simple plant location problem with spatial interaction
1996
This paper presents an exact formulation of the simple plant location problem with...
Solving the generalized knapsack problem with variable coefficients
Solving the generalized knapsack problem with variable coefficients
1996
In this article the authors present methods based on Lagrangian duality and...
Linear mean value cross decomposition: A generalization of the Kornai-Liptak method
Linear mean value cross decomposition: A generalization of the Kornai-Liptak method
1992
The paper proposes a modification of cross decomposition, called mean value cross...
Cross decomposition applied to integer programming problems: Duality gaps and convexification in parts
Cross decomposition applied to integer programming problems: Duality gaps and convexification in parts
1994
The paper studies the lower bounds on the optimal objective function value of linear...
On the convergence of cross decomposition
On the convergence of cross decomposition
1990
Cross decomposition is a recent method for mixed integer programming problems,...
Papers per page: