Fair integer programming under dichotomous and cardinal preferences

DOI10.1016/J.EJOR.2024.08.023MaRDI QIDQ6982471zbMATH OpenFDO

Authors Tom Demeulemeester, Dries R. Goossens, Ben Hermans, Roel Leus

Publication date 19 May 2025

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

Full work available at URL https://doi.org/10.1016/J.EJOR.2024.08.023

zbMATH Keywords

fairnessrandomizationinteger programmingcolumn generationinequity

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Integer programming (90C10)

Cites work

• scientific article; zbMATH DE number 40477 (Why is no real title available?)
• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• scientific article; zbMATH DE number 1226098 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 3079001 (Why is no real title available?)
• A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
• A pessimist's approach to one-sided matching
• A theoretical and computational equilibria analysis of a multi-player kidney exchange program
• An extension of the frank and Wolfe method of feasible directions
• Axiomatic models of bargaining
• Collective choice under dichotomous preferences
• Combining leximax fairness and efficiency in a mathematical programming model
• Compact representation of near-optimal integer programming solutions
• Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes
• Consistent probabilistic social choice
• Fair sharing under dichotomous preferences
• Fair-by-design matching
• Fairness in temporal slot assignment
• Fairness over time in dynamic resource allocation with an application in healthcare
• Generating Multiple Solutions for Mixed Integer Programming Problems
• Geometric algorithms and combinatorial optimization
• Individual Monotonicity and Lexicographic Maxmin Solution
• Inequity averse optimization in operational research
• Manipulation of Schemes that Mix Voting with Chance
• Minimizing Total Tardiness on One Machine is NP-Hard
• New insights on integer-programming models for the kidney exchange problem
• On the axiomatic theory of bargaining: a survey of recent results
• Other Solutions to Nash's Bargaining Problem
• Pairwise kidney exchange
• Parametrized algorithms for random serial dictatorship
• Probabilistic Social Choice Based on Simple Voting Comparisons
• Random Matching Under Dichotomous Preferences
• Reducibility among combinatorial problems
• Simplicial decomposition in nonlinear programming algorithms
• The Complexity of Enumeration and Reliability Problems
• The Convex Simplex Method
• The Role of Information in Bargaining: An Experimental Study
• The bargaining problem
• The complexity of computing the permanent
• The computational complexity of random serial dictatorship
• The price of fairness

Cited in

(4)

• Fairness in graph-theoretical optimization problems
• Adaptation, comparison and practical implementation of fairness schemes in kidney exchange programs
• Tournament design: a review from an operational research perspective
• Operational research approaches and mathematical models for kidney exchange: a literature survey and empirical evaluation

This page was built for publication: Fair integer programming under dichotomous and cardinal preferences

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