Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids

DOI10.1007/978-3-642-36694-9_17zbMath1372.05030OpenAlexW165467593MaRDI QIDQ4910816

Leanne Stuive, Guenin, Bertrand

Publication date: 19 March 2013

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10012/7225

zbMATH Keywords

even cycle matroidmulti-commodity flowsellipsoid methodset covering polyhedraLehman's theoremweakly bipartite graphsmax cuteven cut matroid

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Minimax problems in mathematical programming (90C47) Linear programming (90C05) Combinatorial aspects of matroids and geometric lattices (05B35) Signed and weighted graphs (05C22)

Related Items (2)

A survey on flows in graphs and matroids ⋮ Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids

This page was built for publication: Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids