Apportionments with minimum Gini index of disproportionality: a Quadratic Knapsack approach
Author
Abstract
Suggested Citation
DOI: 10.1007/s10479-013-1383-7
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- W. David Pisinger & Anders Bo Rasmussen & Rune Sandvik, 2007. "Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction," INFORMS Journal on Computing, INFORMS, vol. 19(2), pages 280-290, May.
- Alberto Caprara & David Pisinger & Paolo Toth, 1999. "Exact Solution of the Quadratic Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 125-137, May.
- Grimmett, Geoffrey R., 2012. "European apportionment via the Cambridge Compromise," Mathematical Social Sciences, Elsevier, vol. 63(2), pages 68-73.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Giovanni M. Giorgi & Stefania Gubbiotti, 2017. "Celebrating the Memory of Corrado Gini: a Personality Out of the Ordinary," International Statistical Review, International Statistical Institute, vol. 85(2), pages 325-339, August.
- Kerem Akartunalı & Philip A. Knight, 2017. "Network models and biproportional rounding for fair seat allocations in the UK elections," Annals of Operations Research, Springer, vol. 253(1), pages 1-19, June.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Fennich, M. Eliass & Fomeni, Franklin Djeumou & Coelho, Leandro C., 2024. "A novel dynamic programming heuristic for the quadratic knapsack problem," European Journal of Operational Research, Elsevier, vol. 319(1), pages 102-120.
- Britta Schulze & Michael Stiglmayr & Luís Paquete & Carlos M. Fonseca & David Willems & Stefan Ruzika, 2020. "On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(1), pages 107-132, August.
- Nihal Berktaş & Hande Yaman, 2021. "A Branch-and-Bound Algorithm for Team Formation on Social Networks," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1162-1176, July.
- Gabriel Lopez Zenarosa & Oleg A. Prokopyev & Eduardo L. Pasiliao, 2021. "On exact solution approaches for bilevel quadratic 0–1 knapsack problem," Annals of Operations Research, Springer, vol. 298(1), pages 555-572, March.
- Richard J. Forrester & Warren P. Adams & Paul T. Hadavas, 2010. "Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(1), pages 1-12, February.
- David Bergman, 2019. "An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 477-492, July.
- Franklin Djeumou Fomeni & Adam N. Letchford, 2014. "A Dynamic Programming Heuristic for the Quadratic Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 173-182, February.
- Renaud Chicoisne, 2023. "Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes," Computational Optimization and Applications, Springer, vol. 84(3), pages 789-831, April.
- Caprara, Alberto, 2008. "Constrained 0-1 quadratic programming: Basic approaches and extensions," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1494-1503, June.
- Schauer, Joachim, 2016. "Asymptotic behavior of the quadratic knapsack problem," European Journal of Operational Research, Elsevier, vol. 255(2), pages 357-363.
- Laszlo A. Koczy & Peter Biro & Balazs Sziklai, 2017. "US vs. European Apportionment Practices: The Conflict between Monotonicity and Proportionality," CERS-IE WORKING PAPERS 1716, Institute of Economics, Centre for Economic and Regional Studies.
- Antonin Macé & Rafael Treibich, 2021.
"Inducing Cooperation through Weighted Voting and Veto Power,"
American Economic Journal: Microeconomics, American Economic Association, vol. 13(3), pages 70-111, August.
- Antonin Macé & Rafael Treibich, 2018. "Inducing Cooperation through Weighted Voting and Veto Power," Working Papers halshs-01630090, HAL.
- Antonin Macé & Rafael Treibich, 2021. "Inducing Cooperation through Weighted Voting and Veto Power," Post-Print halshs-03342906, HAL.
- Antonin Macé & Rafael Treibich, 2021. "Inducing Cooperation through Weighted Voting and Veto Power," PSE-Ecole d'économie de Paris (Postprint) halshs-03342906, HAL.
- Grimmett, G.R. & Oelbermann, K.-F. & Pukelsheim, F., 2012. "A power-weighted variant of the EU27 Cambridge Compromise," Mathematical Social Sciences, Elsevier, vol. 63(2), pages 136-140.
- Péter Csóka & P. Jean-Jacques Herings, 2018.
"Decentralized Clearing in Financial Networks,"
Management Science, INFORMS, vol. 64(10), pages 4681-4699, October.
- Csóka, P. & Herings, P.J.J., 2016. "Decentralized clearing in financial networks," Research Memorandum 005, Maastricht University, Graduate School of Business and Economics (GSBE).
- Peter Csoka & P. Jean-Jacques Herings, 2016. "Decentralized Clearing in Financial Networks," CERS-IE WORKING PAPERS 1603, Institute of Economics, Centre for Economic and Regional Studies.
- Csóka, Péter & Herings, Jean-Jacques P., 2016. "Decentralized Clearing in Financial Networks," Corvinus Economics Working Papers (CEWP) 2016/14, Corvinus University of Budapest.
- W. David Pisinger & Anders Bo Rasmussen & Rune Sandvik, 2007. "Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction," INFORMS Journal on Computing, INFORMS, vol. 19(2), pages 280-290, May.
- Yuning Chen & Jin-Kao Hao, 2015. "Iterated responsive threshold search for the quadratic multiple knapsack problem," Annals of Operations Research, Springer, vol. 226(1), pages 101-131, March.
- Baldo, Alessandro & Boffa, Matteo & Cascioli, Lorenzo & Fadda, Edoardo & Lanza, Chiara & Ravera, Arianna, 2023. "The polynomial robust knapsack problem," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1424-1434.
- Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2023. "A general purpose exact solution method for mixed integer concave minimization problems," European Journal of Operational Research, Elsevier, vol. 309(3), pages 977-992.
- Biró, Péter & Kóczy, László Á. & Sziklai, Balázs, 2015.
"Fair apportionment in the view of the Venice Commission’s recommendation,"
Mathematical Social Sciences, Elsevier, vol. 77(C), pages 32-41.
- Peter Biro & Laszlo A. Koczy & Balazs Sziklai, 2013. "Fair Apportionment in the View of the Venice Commission's Recommendation," CERS-IE WORKING PAPERS 1338, Institute of Economics, Centre for Economic and Regional Studies.
- László Á. Kóczy & Balázs Sziklai & Péter Biró, 2013. "Fair Apportionment in the View of the Venice Commission's Recommendation," Working Paper Series 1302, Óbuda University, Keleti Faculty of Business and Management.
- Vicky Mak & Tommy Thomadsen, 2006. "Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem," Journal of Combinatorial Optimization, Springer, vol. 11(4), pages 421-434, June.
More about this item
Keywords
Proportional methods; Gini index; Quadratic Knapsack;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:215:y:2014:i:1:p:257-267:10.1007/s10479-013-1383-7. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.