Optimal cocircuits in regular matroids and applications

DOI10.1016/0771-050X(82)90039-0MaRDI QIDQ1164550zbMATH OpenOpenAlexFDO

Authors Horst W. Hamacher

Publication date 1982

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0771-050x(82)90039-0

zbMATH Keywords

computational complexitycombinatorial optimizationNP-completenessordered groupsshortest path problemsregular matroidsminimal cutoptimal cocircuits

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35) Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites work

• scientific article; zbMATH DE number 3156015 (Why is no real title available?)
• scientific article; zbMATH DE number 3156381 (Why is no real title available?)
• scientific article; zbMATH DE number 3735581 (Why is no real title available?)
• scientific article; zbMATH DE number 3475221 (Why is no real title available?)
• scientific article; zbMATH DE number 3518832 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• scientific article; zbMATH DE number 3227800 (Why is no real title available?)
• scientific article; zbMATH DE number 3290885 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• scientific article; zbMATH DE number 3365043 (Why is no real title available?)
• scientific article; zbMATH DE number 3385667 (Why is no real title available?)
• Algebraic flows in regular matroids
• An Out-of-Kilter Method for Minimal-Cost Flow Problems
• An algebraic approach to assignment problems
• Decomposition of group flows in regular matroids
• Linear and combinatorial optimization in ordered algebraic structures
• Maximal Flow Through a Network
• New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
• Some polyhedra related to combinatorial problems
• The matroids with the max-flow min-cut property
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

This page was built for publication: Optimal cocircuits in regular matroids and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1164550)