Abstract
The network loading problem (NLP) is a specialized capacitated network design problem in which prescribed point-to-point demand between various pairs of nodes of a network must be met by installing (loading) a capacitated facility. We can load any number of units of the facility on each of the arcs at a specified arc dependent cost. The problem is to determine the number of facilities to be loaded on the arcs that will satisfy the given demand at minimum cost.
This paper studies two core subproblems of the NLP. The first problem, motivated by a Lagrangian relaxation approach for solving the problem, considers a multiple commodity, single arc capacitated network design problem. The second problem is a three node network; this specialized network arises in larger networks if we aggregate nodes. In both cases, we develop families of facets and completely characterize the convex hull of feasible solutions to the integer programming formulation of the problems. These results in turn strengthen the formulation of the NLP.
This is a preview of subscription content, log in via an institution to check access.
References
E. Balas and W.R. Pulleyblank, “The perfectly matchable subgraph polytope of a bipartite graph,”Networks 13 (1983) 486–516.
E. Balas and W.R. Pulleyblank, “The perfectly matchable subgraph polytope of an arbitrary graph,”Combinatorica 9 (1989) 321–337.
I. Barany, T.J. Van Roy and L.A. Wolsey, “Uncapacitated lot sizing: The convex hull of solutions,”Mathematical Programming Study 22 (1984) 32–43.
H. Crowder, E.L. Johnson and P.W. Padberg, “Solving large-scale zero–one linear programming problems,”Operations Research 31 (1983) 803–834.
G. Cornuejols, R. Sridharan and J.M. Thizy, “A comparison of heuristics and relaxations for the capacitated plant location problem,”European Journal of Operations Research 50 (1991) 280–297.
J. Edmonds, “Maximum matching and a polyhedron with 0–1 vertices,”Journal of Research of the National Bureau of Standards 69B (1965) 125–130.
J. Edmonds, “Submodular functions, matroids and certain polyhedra,” in: R. Guy et al., eds.,Combinatorial Structures and their Applications (Gordon and Breach, London, 1970) pp. 69–87.
J. Edmonds, “Matroids and the greedy algorithm,”Mathematical Programming 1 (1971) 127–136.
A.M. Geoffrion, “Lagrangian relaxation for integer programming,”Mathematical Programming Study 2 (1974) 82–114.
J.M.Y. Leung, T.L. Magnanti and V. Singhal, “Routing in point to point delivery ststems,”Transportation Science 24 (1990) 245–260.
T.L. Magnanti, P. Mirchandani and R. Vachani, “Modeling and solving the capacitated network loading problem,” Working Paper No. 709, Katz Graduate School of Business, University of Pittsburgh (Pittsburgh, PA, 1991).
P. Mirchandani, “Polyhedral structure of the capacitated network design problem with an application to the telecommunication industry,” Unpublished Ph.D. dissertation, MIT, (Cambridge, MA, 1989).
M.W. Padberg, T.J. Van Roy and L.A. Wolsey, “Valid inequalities for fixed charge problems,”Operations Research 33 (1985) 842–861.
B.A. Papernov, “Feasibility of multicommodity flows,” in: A. Friedman, ed.,Studies in Discrete Optimization, (Idzat. “Nauka”, Moscow, 1976) pp. 230–261. [In Russian.]
W.B. Powell and Y. Sheffi, “The load planning problem of LTL motor carriers: Problem description and a proposed solution approach,”Transportation Research 17A (1983) 471–480.
R. Vachani, “Design of private communication networks,” TM 0027-07-88-446, GTE Laboratories Incorporated (Waltham, MA, 1988).
Author information
Authors and Affiliations
Additional information
Research of this author was supported in part by a Faculty Grant from the Katz Graduate School of Business, University of Pittsburgh.
Rights and permissions
About this article
Cite this article
Magnanti, T.L., Mirchandani, P. & Vachani, R. The convex hull of two core capacitated network design problems. Mathematical Programming 60, 233–250 (1993). https://doi.org/10.1007/BF01580612
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01580612