Finite checkability for integer rounding properties in combinatorial programming problems

DOI10.1007/BF01581034zbMath0473.90059OpenAlexW2092751629MaRDI QIDQ3929541

Shari R. Baum, Leslie E. jun. Trotter

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial optimizationinteger round-up propertyinteger round-down propertyfinite verification processFulkerson's pluperfect graph theorem

Mathematics Subject Classification ID

Integer programming (90C10) Positive matrices and their generalizations; cones of matrices (15B48) Matrices of integers (15B36)

Related Items

Applying Lehman's theorems to packing problems ⋮ Membership criteria and containments of powers of monomial ideals ⋮ Integral decomposition in polyhedra ⋮ A polynomial algorithm for integer programming covering problems satisfying the integer round-up property ⋮ Integer Rounding for Polymatroid and Branching Optimization Problems ⋮ Total weak unimodularity: Testing and applications

Cites Work

• Anti-blocking polyhedra
• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• A polynomial algorithm for integer programming covering problems satisfying the integer round-up property
• Blocking and anti-blocking pairs of polyhedra
• Unnamed Item
• Unnamed Item

This page was built for publication: Finite checkability for integer rounding properties in combinatorial programming problems