Integral decomposition in polyhedra

DOI10.1007/BF02591770zbMATH Open0504.90051OpenAlexW2065925866MaRDI QIDQ4740329FDOQ4740329

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

network flowsdirected graphconvex polyhedratotally unimodular matrixbranchingsintegral polymatroidstrongly-base-orderable matroidsweak integral decomposition

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

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

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)