Home > Research > Publications & Outputs > Feasibility in uncapacitated networks
View graph of relations

Feasibility in uncapacitated networks: the effect of individual arcs and nodes

Research output: Contribution to journalJournal articlepeer-review

Published

Standard

Feasibility in uncapacitated networks : the effect of individual arcs and nodes. / Ghannadan, Saied; Wallace, Stein W.

In: Annals of Operations Research, Vol. 64, No. 1, 12.1996, p. 197-210.

Research output: Contribution to journalJournal articlepeer-review

Harvard

APA

Vancouver

Author

Ghannadan, Saied ; Wallace, Stein W. / Feasibility in uncapacitated networks : the effect of individual arcs and nodes. In: Annals of Operations Research. 1996 ; Vol. 64, No. 1. pp. 197-210.

Bibtex

@article{7315c2034f944ef6920e957a79545254,
title = "Feasibility in uncapacitated networks: the effect of individual arcs and nodes",
abstract = "The purpose of this paper is to investigate the effect of individual arcs and nodes on the description of feasibility in an uncapacitated network. This is done by developing an iterative algorithm for finding all (necessary) Gale-Hoffman inequalities for the network.",
keywords = "Feasibility, uncapacitated network , Gale-Hoffman inequality, linear programming , frame , cut, facet, polar matrix",
author = "Saied Ghannadan and Wallace, {Stein W}",
year = "1996",
month = dec,
doi = "10.1007/BF02187646",
language = "English",
volume = "64",
pages = "197--210",
journal = "Annals of Operations Research",
issn = "0254-5330",
publisher = "Springer",
number = "1",

}

RIS

TY - JOUR

T1 - Feasibility in uncapacitated networks

T2 - the effect of individual arcs and nodes

AU - Ghannadan, Saied

AU - Wallace, Stein W

PY - 1996/12

Y1 - 1996/12

N2 - The purpose of this paper is to investigate the effect of individual arcs and nodes on the description of feasibility in an uncapacitated network. This is done by developing an iterative algorithm for finding all (necessary) Gale-Hoffman inequalities for the network.

AB - The purpose of this paper is to investigate the effect of individual arcs and nodes on the description of feasibility in an uncapacitated network. This is done by developing an iterative algorithm for finding all (necessary) Gale-Hoffman inequalities for the network.

KW - Feasibility

KW - uncapacitated network

KW - Gale-Hoffman inequality

KW - linear programming

KW - frame

KW - cut

KW - facet

KW - polar matrix

U2 - 10.1007/BF02187646

DO - 10.1007/BF02187646

M3 - Journal article

VL - 64

SP - 197

EP - 210

JO - Annals of Operations Research

JF - Annals of Operations Research

SN - 0254-5330

IS - 1

ER -