A simple algorithm that proves half‐integrality of bidirected network programming
From MaRDI portal
Publication:5487821
DOI10.1002/net.20117zbMath1100.05046OpenAlexW4240780037MaRDI QIDQ5487821
Ethan D. Bolker, Thomas Zaslavsky
Publication date: 12 September 2006
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20117
Programming involving graphs or networks (90C35) Integer programming (90C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matroids and geometric lattices (05B35) Signed and weighted graphs (05C22)
Related Items (7)
Recognizing binet matrices ⋮ The number of nowhere-zero flows on graphs and signed graphs ⋮ Resolution of indecomposable integral flows on signed graphs ⋮ Conformal Decomposition of Integral Tensions and Potentials of Signed Graphs ⋮ Convergence and Correctness of Max-Product Belief Propagation for Linear Programming ⋮ Conformal decomposition of integral flows on signed graphs with outer-edges ⋮ On the representability of totally unimodular matrices on bidirected graphs
Cites Work
This page was built for publication: A simple algorithm that proves half‐integrality of bidirected network programming
