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

DOI10.1007/BF01585167zbMath0802.90041OpenAlexW2023048520MaRDI QIDQ1321672

Roger J.-B. Wets, Stein W. Wallace

Publication date: 23 May 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585167

zbMATH Keywords

facetsfeasible flowconvex polyhedral setGale-Hoffman inequalities

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (5)

Consistency, redundancy, and implied equalities in linear systems ⋮ Feasibility in capacitated networks: The effect of individual arcs and nodes ⋮ Complexity of minimum irreducible infeasible subsystem covers for flow networks ⋮ Single Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables ⋮ Multiparametric demand transportation problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theorem on flows in networks
• Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility
• The perfectly matchable subgraph polytope of a bipartite graph
• On the Existence of a Feasible Flow in a Stochastic Transportation Network
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems

This page was built for publication: The facets of the polyhedral set determined by the Gale-Hoffman inequalities