On the width—length inequality
From MaRDI portal
Publication:3851959
DOI10.1007/BF01588263zbMath0418.90040OpenAlexW4254177583MaRDI QIDQ3851959
Publication date: 1979
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01588263
networksgraphsassignment problemmax-flow min-cutwidth-length inequalityresistor networksW-L matrices
Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Hermitian, skew-Hermitian, and related matrices (15B57) Communication, information (94A99) Applications of graph theory to circuits and networks (94C15)
Related Items
Families of cuts with the MFMC-property, An extension of Lehman's theorem and ideal set functions, Binary group and Chinese postman polyhedra, Delta Minors, Delta Free Clutters, and Entanglement, An analytic symmetrization of max flow-min cut, Lehman's Theorem and the Directed Steiner Tree Problem, Intersecting and dense restrictions of clutters in polynomial time, Intersecting restrictions in clutters, Polyhedra of regular p-nary group problems, Applying Lehman's theorems to packing problems, \((0,\pm 1)\) ideal matrices, (0, ±1) ideal matrices, Deltas, extended odd holes and their blockers, Arithmetic relations in the set covering polyhedron of circulant clutters, The nonidealness index of circulant matrices, On the behavior of the \(N_{+}\)-operator under blocker duality, Fractional packing in ideal clutters, Blocking and anti-blocking pairs of polyhedra, Quasi-balanced matrices, The Klein bottle and multicommodity flows, Extremal Length and Width of Blocking Polyhedra, Kirchhoff Spaces and Multiport Networks, On the cut polyhedron., A sharp bound on the size of a connected matroid, On circulant thin Lehman matrices, An analytical comparison of different formulations of the travelling salesman problem, Cuboids, a class of clutters, A unified interpretation of several combinatorial dualities, On the mixed set covering, packing and partitioning polytope, Progress on the description of identifying code polyhedra for some families of split graphs, Lehman's forbidden minor characterization of ideal 0-1 matrices, Some insight into characterizations of minimally nonideal matrices, Ideal clutters, Unnamed Item, Circuit and fractional circuit covers of matroids, Perfect, ideal and balanced matrices, On a certain class of nonideal clutters, The nonidealness index of rank-ideal matrices, On packing and covering polyhedra of consecutive ones circulant clutters, A new infinite class of ideal minimally non-packing clutters, The matroids with the max-flow min-cut property, Vertex adjacencies in the set covering polyhedron, Clutters with \(\tau_ 2 \Relbar 2\tau\), On the set covering polyhedron of circulant matrices, Opposite Elements in Clutters, Ideal Clutters That Do Not Pack, Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices, The star dichromatic number, On Four Problems in Graph Theory, Thin Lehman matrices arising from finite groups, Structure of cubic Lehman matrices, Note on: N. E. Aguilera, M. S. Escalante, G. L. Nasini, ``The disjunctive procedure and blocker duality, Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices, A catalog of minimally nonideal matrices, Graph imperfection. I, A characterization of weakly bipartite graphs, Non-regular square bipartite designs, Packing rooted directed cuts in a weighted directed graph
Cites Work
