Optimal cocircuits in regular matroids and applications

DOI10.1016/0771-050X(82)90039-0zbMath0485.90083OpenAlexW2063772925MaRDI QIDQ1164550

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) Extremal problems in graph theory (05C35) Integer programming (90C10) Deterministic network models in operations research (90B10) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Algebraic flows in regular matroids
• Linear and combinatorial optimization in ordered algebraic structures
• Decomposition of group flows in regular matroids
• The matroids with the max-flow min-cut property
• Some polyhedra related to combinatorial problems
• Maximal Flow Through a Network
• New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
• An Out-of-Kilter Method for Minimal-Cost Flow Problems
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• An algebraic approach to assignment problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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