Feasibility in capacitated networks: The effect of individual arcs and nodes (Q1380444): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A theorem on flows in networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Consistency, redundancy, and implied equalities in linear systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3730336 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Preprocessing in Stochastic Programming: The Case of Uncapacitated Networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Preprocessing in Stochastic Programming: The Case of Linear Programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The facets of the polyhedral set determined by the Gale-Hoffman inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Preprocessing in Stochastic Programming: The Case of Capacitated Networks / rank | |||
Normal rank |
Revision as of 11:19, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Feasibility in capacitated networks: The effect of individual arcs and nodes |
scientific article |
Statements
Feasibility in capacitated networks: The effect of individual arcs and nodes (English)
0 references
4 March 1998
0 references
feasibility
0 references
capacitated network
0 references
Gale-Hoffman inequalities
0 references