The convex hull of two core capacitated network design problems (Q689128)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The convex hull of two core capacitated network design problems |
scientific article; zbMATH DE number 440077
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The convex hull of two core capacitated network design problems |
scientific article; zbMATH DE number 440077 |
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
0.89680684
0 references
0.88863105
0 references
0.88838345
0 references
0.8849296
0 references
0.8819929
0 references
0.8819929
0 references
0.87967515
0 references
0.87748706
0 references
0.87699056
0 references
