Total unimodularity and the Euler-subgraph problem

DOI10.1016/0167-6377(88)90024-7zbMath0652.90075OpenAlexW2080973177MaRDI QIDQ1107442

Manfred W. Padberg

Publication date: 1988

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(88)90024-7

zbMATH Keywords

surveycharacterizationsconvex polyhedratotally unimodular matricesEuler-subgraph problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items

Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods, Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix, The Boolean quadratic polytope: Some characteristics, facets and relatives, Structural properties and recognition of restricted and strongly unimodular matrices, Sufficient enlargements of minimal volume for finite-dimensional normed linear spaces, On Padberg's conjecture about almost totally unimodular matrices, Minimal-volume projections of cubes and totally unimodular matrices

Cites Work

• A note on the total unimodularity of matrices
• Local unimodularity of matrix-vector pairs
• Characterization of Totally Unimodular Matrices
• Integral Extreme Points
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item