A polynomial algorithm for integer programming covering problems satisfying the integer round-up property

DOI10.1007/BF01581039zbMath0473.90060DBLPjournals/mp/Orlin82WikidataQ59592755 ScholiaQ59592755MaRDI QIDQ3929542

James B. Orlin

Publication date: 1982

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

zbMATH Keywords

polynomial time algorithminteger round-up propertygeneralized covering problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Positive matrices and their generalizations; cones of matrices (15B48) Matrices of integers (15B36)

Related Items (5)

Reliability, covering and balanced matrices ⋮ Coloring fuzzy circular interval graphs ⋮ A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption ⋮ Integral decomposition in polyhedra ⋮ Finite checkability for integer rounding properties in combinatorial programming problems

Cites Work

• Finite checkability for integer rounding properties in combinatorial programming problems

This page was built for publication: A polynomial algorithm for integer programming covering problems satisfying the integer round-up property