A rounding algorithm for integer programs

DOI10.1016/0166-218X(92)00174-KzbMath0811.90075MaRDI QIDQ1327212

R. Chandrasekaran, Sambhavi Lakshminarayanan

Publication date: 1 May 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

rounding procedure

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items (1)

A combinatorial algorithm for Horn programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The matroids with the max-flow min-cut property
• Incidence matrices and interval graphs
• A decomposition algorithm for linear relaxation of the weightedr-covering problem
• Cyclic Scheduling via Integer Programs with Circular Ones
• Integer and Fractional Matchings
• An extension of the edge covering problem
• Integer Solution to Synthesis of Communication Networks
• Vertex packings: Structural properties and algorithms
• Extended Horn sets in propositional logic

This page was built for publication: A rounding algorithm for integer programs