On box totally dual integral polyhedra
- 1 January 1986
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 34 (1) , 48-61
- https://doi.org/10.1007/bf01582162
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Total Dual Integrality from Directed Graphs, Crossing Families, and Sub- and Supermodular FunctionsPublished by Elsevier ,1984
- Total Dual Integrality of Linear Inequality SystemsPublished by Elsevier ,1984
- Polynomial Algorithms for Perfect GraphsPublished by Elsevier ,1984
- A polynomial-time test for total dual integrality in fixed dimensionPublished by Springer Nature ,1984
- The perfectly matchable subgraph polytope of a bipartite graphNetworks, 1983
- Polyhedral CombinatoricsPublished by Springer Nature ,1983
- A Min-Max Relation for Submodular Functions on GraphsPublished by Elsevier ,1977
- An unbounded matroid intersection polyhedronLinear Algebra and its Applications, 1977
- Blocking and anti-blocking pairs of polyhedraMathematical Programming, 1971
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970