Home > Research > Publications & Outputs > The facets of the polyhedral set determined by ...
View graph of relations

The facets of the polyhedral set determined by the Gale-Hoffman inequalities

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

The facets of the polyhedral set determined by the Gale-Hoffman inequalities. / Wallace, Stein W; Wets, Roger J-B.
In: Mathematical Programming, Vol. 62, No. 1-3, 02.1993, p. 215-222.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Wallace, SW & Wets, RJ-B 1993, 'The facets of the polyhedral set determined by the Gale-Hoffman inequalities', Mathematical Programming, vol. 62, no. 1-3, pp. 215-222. https://doi.org/10.1007/BF01585167

APA

Vancouver

Wallace SW, Wets RJ-B. The facets of the polyhedral set determined by the Gale-Hoffman inequalities. Mathematical Programming. 1993 Feb;62(1-3):215-222. doi: 10.1007/BF01585167

Author

Wallace, Stein W ; Wets, Roger J-B. / The facets of the polyhedral set determined by the Gale-Hoffman inequalities. In: Mathematical Programming. 1993 ; Vol. 62, No. 1-3. pp. 215-222.

Bibtex

@article{6a31b70f2e554541943d4d7468dab2af,
title = "The facets of the polyhedral set determined by the Gale-Hoffman inequalities",
abstract = "The Gale—Hoffman inequalities characterize feasible external flow in a (capacitated) network. Among these inequalities, those that are redundant can be identified through a simple arc-connectedness criterion.",
author = "Wallace, {Stein W} and Wets, {Roger J-B}",
year = "1993",
month = feb,
doi = "10.1007/BF01585167",
language = "English",
volume = "62",
pages = "215--222",
journal = "Mathematical Programming",
issn = "0025-5610",
publisher = "Springer-Verlag GmbH and Co. KG",
number = "1-3",

}

RIS

TY - JOUR

T1 - The facets of the polyhedral set determined by the Gale-Hoffman inequalities

AU - Wallace, Stein W

AU - Wets, Roger J-B

PY - 1993/2

Y1 - 1993/2

N2 - The Gale—Hoffman inequalities characterize feasible external flow in a (capacitated) network. Among these inequalities, those that are redundant can be identified through a simple arc-connectedness criterion.

AB - The Gale—Hoffman inequalities characterize feasible external flow in a (capacitated) network. Among these inequalities, those that are redundant can be identified through a simple arc-connectedness criterion.

U2 - 10.1007/BF01585167

DO - 10.1007/BF01585167

M3 - Journal article

VL - 62

SP - 215

EP - 222

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 1-3

ER -