The max-flow min-cut property and \(\pm 1\)-resistant sets

DOI10.1016/j.dam.2020.10.003zbMath1457.90119OpenAlexW3096842009MaRDI QIDQ2217497

Ahmad Abdi, Cornuéjols, Gérard

Publication date: 29 December 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.10.003

zbMATH Keywords

max-flow min-cut propertystructure theoremideal cluttersgeneralized set covering inequalitiescropped cubesresistant sets

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Uses Software

• cuboids-code

Cites Work

• Unnamed Item
• The matroids with the max-flow min-cut property
• Ideal 0, 1 matrices
• Cropped cubes
• Cuboids, a class of clutters
• Idealness and 2-resistant sets
• Combinatorial Optimization
• A generalization of max flow—min cut
• Ideal Clutters That Do Not Pack
• The packing property.

This page was built for publication: The max-flow min-cut property and \(\pm 1\)-resistant sets