scientific article; zbMATH DE number 3628712
From MaRDI portal
Publication:4190428
zbMath0404.90053MaRDI QIDQ4190428
Shari R. Baum, Leslie E. jun. Trotter
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial Covering ProblemCombinatorial Packing ProblemInteger RoundingPolyhedral DecompositionTotally Unimodular Systems
Linear programming (90C05) Decomposition methods (49M27) Combinatorial aspects of packing and covering (05B40)
Related Items
Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory, Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix, Unnamed Item, Minmax relations for cyclically ordered digraphs, Shifted matroid optimization, Symmetry-breaking inequalities for ILP with structured sub-symmetry, Unnamed Item, 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, A decomposition theory for matroids. VII: Analysis of minimal violation matrices, Parameterized shifted combinatorial optimization, The unimodular intersection problem, On some characterisations of totally unimodular matrices, Polyhedra with the integer Carathéodory property, Path Partitions, Cycle Covers and Integer Decomposition, Integral decomposition in polyhedra, Integer Rounding for Polymatroid and Branching Optimization Problems