Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Solving the generalized apportionment problem through the optimization of discrepancy functions

From MaRDI portal
Publication:5935397
Jump to:navigation, search

DOI10.1016/S0377-2217(00)00110-7zbMath1014.91024MaRDI QIDQ5935397

Ramon Companys, Joaquín Bautista, Albert Corominas

Publication date: 11 May 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)



zbMATH Keywords

apportionment problemcombinatorial analysis


Mathematics Subject Classification ID

Voting theory (91B12) History, political science (91F10)


Related Items (1)

A branch and bound algorithm for the response time variability problem




Cites Work

  • Unnamed Item
  • Modelling and solving the production rate variation problem (PRVP)
  • A Class of New Methods for Congressional Apportionment
  • Appointment Methods for the House of Representatives and the Court Challenges




This page was built for publication: Solving the generalized apportionment problem through the optimization of discrepancy functions

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5935397&oldid=12080392"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 00:39.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki