A cyclic integer covering problem
From MaRDI portal
Publication:2277140
branch-and- bound interactive solutiondoubly stochastic matricesinteger coveringmanpower planningunimodularity
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Stochastic matrices (15B51) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Theory of organizations, manpower planning in operations research (90B70) Linear programming (90C05) Integer programming (90C10)
Recommendations
Cites work
- A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
- Classes of linear programs with integral optimal solutions
- Cyclic Scheduling via Integer Programs with Circular Ones
- scientific article; zbMATH DE number 3155235 (Why is no real title available?)
- scientific article; zbMATH DE number 4109935 (Why is no real title available?)
- scientific article; zbMATH DE number 3438384 (Why is no real title available?)
- scientific article; zbMATH DE number 3314878 (Why is no real title available?)
- scientific article; zbMATH DE number 3376984 (Why is no real title available?)
- Line-sum-symmetric scalings of square nonnegative matrices
- On the integrality of an extreme solution to pluperfect graph and balanced systems
- Optimal Scheduiing of Two Consecutive Idle Periods
- Unnetworks, with Applications to Idle Time Scheduling
Cited in
(4)- 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
- scientific article; zbMATH DE number 434877 (Why is no real title available?)
This page was built for publication: A cyclic integer covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277140)