Reliability, covering and balanced matrices

DOI10.1016/0167-6377(94)00047-AzbMath0835.90051MaRDI QIDQ1892656

Feng-Li Lin, Michael O. Ball

Publication date: 19 June 1995

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

zbMATH Keywords

reliability optimizationbalanced matricesgeneralized covering integer programvehicle location

Mathematics Subject Classification ID

Integer programming (90C10) Reliability, availability, maintenance, inspection in operations research (90B25) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of knapsacks with the max-flow--min-cut property
• A Class of Balanced Matrices Arising from Location Problems
• Solving Large-Scale Zero-One Linear Programming Problems
• A polynomial algorithm for integer programming covering problems satisfying the integer round-up property
• Reliability covering problems
• Covering, Packing and Knapsack Problems
• A Reliability Model Applied to Emergency Service Vehicle Location
• Bottleneck extrema
• Canonical Cuts on the Unit Hypercube
• Balanced matrices
• Blocking and anti-blocking pairs of polyhedra

This page was built for publication: Reliability, covering and balanced matrices