Finite checkability for integer rounding properties in combinatorial programming problems

DOI10.1007/BF01581034MaRDI QIDQ3929541zbMATH OpenOpenAlexFDO

Authors 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 optimizationfinite verification processFulkerson's pluperfect graph theoreminteger round-down propertyinteger round-up property

Mathematics Subject Classification ID

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

Cites work

• A characterization of perfect graphs
• A polynomial algorithm for integer programming covering problems satisfying the integer round-up property
• Anti-blocking polyhedra
• Blocking and anti-blocking pairs of polyhedra
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• scientific article; zbMATH DE number 3420800 (Why is no real title available?)
• Normal hypergraphs and the perfect graph conjecture

Cited in

(6)

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

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

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