A Class of New Methods for Congressional Apportionment
From MaRDI portal
Cited in
(10)- A simple approach to the product rate variation problem via axiomatics
- Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem
- Just-in-time scheduling in modern mass production environment
- A note on bottleneck product rate variation problem with square-deviation objective
- Solving the generalized apportionment problem through the optimization of discrepancy functions
- The bounds of votes of divisor electoral methods
- A generalized parametric divisor method for political apportionment
- Solution of the Liu-Layland problem via bottleneck just-in-time sequencing
- Apportionment methods and the Liu-Layland problem
- An application of a few inequalities among sequences in electoral systems
This page was built for publication: A Class of New Methods for Congressional Apportionment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3206652)