A cyclic integer covering problem

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

Yanyan Li

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0895-7177(90)90343-l

zbMATH Keywords

unimodularitydoubly stochastic matricesmanpower planninginteger coveringbranch-and- bound interactive solution

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Stochastic matrices (15B51) Theory of organizations, manpower planning in operations research (90B70)

Related Items (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: A cyclic integer covering problem