The convex hull of two core capacitated network design problems (Q689128): Difference between revisions
From MaRDI portal
Latest revision as of 10:31, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The convex hull of two core capacitated network design problems |
scientific article |
Statements
The convex hull of two core capacitated network design problems (English)
0 references
6 December 1993
0 references
This paper studies the polyhedral structure of two subproblems of a capacitated network design problem, develops families of facets and completely characterize the convex hull of feasible solutions to the integer programming formulation of the problems.
0 references
polyhedral structure
0 references
capacitated network design
0 references
facets
0 references
