Strongly connected orientations and integer lattices

DOI10.1007/978-3-031-93112-3_1MaRDI QIDQ6880156zbMATH OpenFDO

Authors Ahmad Abdi, Gérard Cornuéjols, S. Y. Liu, Olha Silina

Publication date 22 December 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-93112-3_1

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Cites work

• A Minimax Theorem for Directed Graphs
• Approximately packing Dijoins via nowhere-zero flows
• Brick decompositions and the matching rank of graphs
• Combinatorial optimization. Packing and covering
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Connections in combinatorial optimization
• Dyadic linear programming and extensions
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• scientific article; zbMATH DE number 1970438 (Why is no real title available?)
• scientific article; zbMATH DE number 1859030 (Why is no real title available?)
• scientific article; zbMATH DE number 3378938 (Why is no real title available?)
• Matching structure and the matching lattice
• On Packing Dijoins in Digraphs and Weighted Digraphs
• Optimal ear decompositions of matching covered graphs and bases for the matching lattice
• Total dual integrality implies local strong unimodularity

This page was built for publication: Strongly connected orientations and integer lattices

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