The Convex Hull of Two Core Capacitated Network Design Problems
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...
Main Authors: | Magnanti, Thomas L., Mirchandani, Prakash, Vachani, Rita |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/5164 |
Similar Items
-
Shortest Paths, Network Design and Associated Polyhedra
by: Magnanti, Thomas L., et al.
Published: (2004) -
Application of sorting algorithms for convex hull determination
by: Mihaela Todorova, et al.
Published: (2018-09-01) -
Quality control of oceanographic in situ data from Argo floats using climatological convex hulls
by: T.V.S. Udaya Bhaskar, et al.
Published: (2017-01-01) -
An efficient planar incremental convex hull algorithm to find the edges of the boundary polygon of the convex hull of a set of points
by: K. R. Wijeweera, et al.
Published: (2021-09-01) -
Parameter Identification of Bivariate Fractal Interpolation Surfaces by Using Convex Hulls
by: Vasileios Drakopoulos, et al.
Published: (2023-06-01)