A cyclic integer covering problem

DOI10.1016/0895-7177(90)90343-LzbMath0724.90041MaRDI QIDQ2277140

Yanyan Li

Publication date: 1990

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

zbMATH Keywords

unimodularity; doubly stochastic matrices; manpower planning; integer covering; branch-and- bound interactive solution

Mathematics Subject Classification ID

90C10: Integer programming

90C05: Linear programming

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

90-08: Computational methods for problems pertaining to operations research and mathematical programming

15B51: Stochastic matrices

90B70: Theory of organizations, manpower planning in operations research

Related Items

Integer programming to schedule a hierarchical workforce with variable demands, An integer programming model for hierarchical workforce scheduling problem, An integrated staff-sizing approach considering feasibility of scheduling decision

Cites Work

• On the integrality of an extreme solution to pluperfect graph and balanced systems
• Classes of linear programs with integral optimal solutions
• Line-sum-symmetric scalings of square nonnegative matrices
• Cyclic Scheduling via Integer Programs with Circular Ones
• A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
• Unnetworks, with Applications to Idle Time Scheduling
• Optimal Scheduiing of Two Consecutive Idle Periods
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item