The facets of the polyhedral set determined by the Gale-Hoffman inequalities (Q1321672): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The perfectly matchable subgraph polytope of a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3274170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence of a Feasible Flow in a Stochastic Transportation Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730336 / rank
 
Normal rank

Revision as of 14:20, 22 May 2024

scientific article
Language Label Description Also known as
English
The facets of the polyhedral set determined by the Gale-Hoffman inequalities
scientific article

    Statements

    The facets of the polyhedral set determined by the Gale-Hoffman inequalities (English)
    0 references
    0 references
    0 references
    23 May 1994
    0 references
    facets
    0 references
    convex polyhedral set
    0 references
    feasible flow
    0 references
    Gale-Hoffman inequalities
    0 references

    Identifiers