scientific article; zbMATH DE number 3628712

MaRDI QIDQ4190428zbMATH OpenFDO

Authors Shari R. Baum, Leslie E. jun. Trotter

Publication date 1978

zbMATH Keywords

Combinatorial Covering ProblemCombinatorial Packing ProblemInteger RoundingPolyhedral DecompositionTotally Unimodular Systems

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Decomposition methods (49M27) Linear programming (90C05)

Cited in

(18)

• A decomposition theory for matroids. VII: Analysis of minimal violation matrices
• Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
• Shifted matroid optimization
• The unimodular intersection problem
• Symmetry-breaking inequalities for ILP with structured sub-symmetry
• Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
• Computation and efficiency of potential function minimizers of combinatorial congestion games
• Colorings of k-balanced matrices and integer decomposition property of related polyhedra
• Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory
• Extension complexity, MSO logic, and treewidth
• Path Partitions, Cycle Covers and Integer Decomposition
• Integer Rounding for Polymatroid and Branching Optimization Problems
• On some characterisations of totally unimodular matrices
• Integral decomposition in polyhedra
• Congestion minimization for multipath routing via multiroute flows
• Prefix-bounded matrices
• Polyhedra with the integer Carathéodory property
• Minmax relations for cyclically ordered digraphs

This page was built for publication:

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