A characterization of the uncapacitated network design polytope

• The uncapacitated network design problem is considered. We show that the feasible polytope of the continuous relaxation of this problem has the property that any path along the edges of the convex hull of its integer points is also a path along the edges of the polytope itself. This property may be of computational interest since it implies the possibility of solving the uncapacitated network design problem by a pivoting scheme. © 1992.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Maskinteknik -- Produktionsteknik, arbetsvetenskap och ergonomi (hsv//swe)

ENGINEERING AND TECHNOLOGY  -- Mechanical Engineering -- Production Engineering, Human Work Science and Ergonomics (hsv//eng)

Keyword

integer programming

linear programming

polyhedral combinatorics

quasi-integrality

uncapacitated network design

Industrial Logistics

Industriell logistik

Publication and Content Type

ref (subject category)

art (subject category)