Integral decomposition in polyhedra

DOI10.1007/BF02591770MaRDI QIDQ4740329zbMATH OpenOpenAlexFDO

Authors Colin McDiarmid

Publication date 1983

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02591770

zbMATH Keywords

branchingsconvex polyhedradirected graphintegral polymatroidnetwork flowsstrongly-base-orderable matroidstotally unimodular matrixweak integral decomposition

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of packing and covering (05B40) Polytopes and polyhedra (52Bxx) Integer programming (90C10)

Cites work

• A polynomial algorithm for integer programming covering problems satisfying the integer round-up property
• Blocking and anti-blocking pairs of polyhedra
• Blocking pairs of polyhedra arising from network flows
• Blocking, antiblocking, and pairs of matroids and polymatroids
• Disjoint Common Transversals and Exchange Structures
• Finite checkability for integer rounding properties in combinatorial programming problems
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3121293 (Why is no real title available?)
• scientific article; zbMATH DE number 3655693 (Why is no real title available?)
• scientific article; zbMATH DE number 3600054 (Why is no real title available?)
• scientific article; zbMATH DE number 3628712 (Why is no real title available?)
• scientific article; zbMATH DE number 3353065 (Why is no real title available?)
• scientific article; zbMATH DE number 3378938 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• scientific article; zbMATH DE number 3410784 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• Induced Matroids
• Integer Rounding for Polymatroid and Branching Optimization Problems
• Network Flows, Minimum Coverings, and the Four-Color Conjectures
• On some characterisations of totally unimodular matrices
• On the Complexity of Timetable and Multicommodity Flow Problems
• Packing rooted directed cuts in a weighted directed graph
• Rado's theorem for polymatroids
• The edge-coloring of complete hypergraphs. I
• The Induction of Matroids by Graphs^†
• Transversal matroid intersections and related packings

Cited in

(7)

• A generalization of Robacker's theorem
• Computation and efficiency of potential function minimizers of combinatorial congestion games
• Edge-disjoint branchings in temporal digraphs
• A decomposition property of polyhedra
• Edge-Disjoint Branchings in Temporal Graphs
• Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
• Polyhedra with the integer Carathéodory property

This page was built for publication: Integral decomposition in polyhedra

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