Vector and matrix apportionment problems and separable convex integer optimization

DOI10.1007/S00186-007-0184-7MaRDI QIDQ2482690zbMATH OpenOpenAlexFDO

Authors Norbert Gaffke, Friedrich Pukelsheim

Publication date 23 April 2008

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-4122

zbMATH Keywords

Alternating maximization procedureConvex programming dualityElementary vectorGraver basisProportional and biproportional roundingTotally unimodular matrix

Mathematics Subject Classification ID

Integer programming (90C10) Convex programming (90C25)

Recommendations

• Divisor methods for proportional representation systems: an optimization approach to vector and matrix apportionment problems
• scientific article; zbMATH DE number 2096649
• Error minimization methods in biproportional apportionment
• Scalings of matrices which have prespecified row sums and column sums via optimization
• Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment

Cites work

• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• Algorithms for proportional matrices in reals and integers
• Convex separable optimization is not much harder than linear optimization
• Divisor methods for proportional representation systems: an optimization approach to vector and matrix apportionment problems
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 1305542 (Why is no real title available?)
• scientific article; zbMATH DE number 1045885 (Why is no real title available?)
• scientific article; zbMATH DE number 1069356 (Why is no real title available?)
• Matrix scaling by network flow
• On the foundations of linear and integer linear programming I
• Optimality criterion for a class of nonlinear integer programs.
• Rounding probabilities: Maximum probability and minimum complexity multipliers
• Rounding with multiplier methods: An efficient algorithm and applications in statistics
• Scrutin proportionnel et optimisation mathématique
• The proportional representation problem in the Second Chamber: an approach via minimal distances
• Variation of cost functions in integer programming

Cited in

(13)

• Error minimization methods in biproportional apportionment
• Certificates of optimality for minimum norm biproportional apportionments
• Network models and biproportional rounding for fair seat allocations in the UK elections
• Alternate scaling algorithm for biproportional divisor methods
• Network flow methods for electoral systems
• Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment
• Certificates of optimality: the third way to biproportional apportionment
• scientific article; zbMATH DE number 2096649 (Why is no real title available?)
• Apportionment with parity constraints
• Proportionality in multiple dimensions to design electoral systems
• Biproportional scaling of matrices and the iterative proportional fitting procedure
• Divisor methods for proportional representation systems: an optimization approach to vector and matrix apportionment problems
• Apportionment methods

This page was built for publication: Vector and matrix apportionment problems and separable convex integer optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482690)