Sökning: onr:"swepub:oai:DiVA.org:ltu-2548" >
A characterization ...
A characterization of the uncapacitated network design polytope
-
- Hellstrand, Johan (författare)
- Department of Mathematics, University of Linköping
-
- Larsson, Torbjörn (författare)
- Department of Mathematics, University of Linköping
-
- Migdalas, Athanasios (författare)
- Department of Mathematics, University of Linköping
-
(creator_code:org_t)
- 1992
- 1992
- Engelska.
-
Ingår i: Operations Research Letters. - 0167-6377 .- 1872-7468. ; 12:3, s. 159-163
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Maskinteknik -- Produktionsteknik, arbetsvetenskap och ergonomi (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Mechanical Engineering -- Production Engineering, Human Work Science and Ergonomics (hsv//eng)
Nyckelord
- integer programming
- linear programming
- polyhedral combinatorics
- quasi-integrality
- uncapacitated network design
- Industrial Logistics
- Industriell logistik
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas