Papers by Kaj Holmberg

Postscript-files (gzipped)

• Brostrom and Holmberg: A New Derivation of Valid Cycles LiTH-MAT-R-2005-03
• Brostrom and Holmberg: On the Extremal Structure of an OSPF Related Cone LiTH-MAT-R-2006-02
• Brostrom and Holmberg: Stronger Necessary Conditions for the Existence of a Compatible OSPF Metric LiTH-MAT-R-2004-08
• Holmberg, Joborn and Melin: Lagrangian Based Heuristics for the Multicommodity Network Flow Problem with Fixed Costs On Paths LiTH-MAT-R-2004-15
• Holmberg: Mean Value Cross Decomposition Based Branch-and-Bound for Mixed Integer Programming Problems LiTH-MAT-R-2004-13
• Holmberg and Yuan: A Lagrangean Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• Holmberg: Exact Solution Methods for Uncapacitated Location Problems with Convex Transportation Costs
• Holmberg and Ling: A Lagrangean Heuristic for the Facility Location Problem with Staircase Costs
• Holmberg: Lagrangean Heuristics for Linear Cost Multicommodity Network Flow Problems
• Holmberg and Tuy: A Production-Transportation Problem with Stochastic Demand and Concave Production Costs
• Holmberg and Hellstrand: Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
• Holmberg: Primal and Dual Decomposition as Organizational Design: Price and/or Resource Directive Decomposition

Old working papers (gzipped postscript)

• Holmberg: Transportation and Location Problems with Staircase Costs
• Holmberg: On the Use of Valid Inequalities in Benders and Cross Decomposition