To cite this record:
Plant location with minimum inventory
Barahona, Francisco
Jensen, David

Date: 1998
Abstract: We present an integer programming model for plant location with inventory costs. The linear programming relaxation has been solved by Dantzig-Wolfe decomposition. In this case the subproblems reduce to the minimum cut problem. We have used subgradient optimization to accelerate the convergence of the D-W algorithm. We present our experience with problems arising in the design of a distribution network for computer spare parts. In most cases, from a fractional solution we were able to derive integer solutions within 4% of optimality. .
Language: Anglès.
Document: Article ; recerca ; article ; publishedVersion
Subject: Plant location ; Minimum cut ; Dantzig-Wolfe decomposition ; Subgradient optimization
Published in: Mathematical Programming, vol. 83 n. 1 (1998) p. 101-111, ISSN 0025-5610

11 p, 470.9 KB
 UAB restricted access

The record appears in these collections:
Articles > Research articles
Articles > Published articles

 Record created 2006-03-13, last modified 2015-01-07

   Favorit i Compartir
QR image