Using \(\ell^p\)-norms for fairness in combinatorial optimisation
From MaRDI portal
Publication:2664297
DOI10.1016/j.cor.2020.104975zbMath1458.90538OpenAlexW3016310386MaRDI QIDQ2664297
Tolga Bektaş, Adam N. Letchford
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/143385/1/fairness.pdf
Mixed integer programming (90C11) Nonlinear programming (90C30) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Inequity averse optimization in operational research
- k-sum optimization problems
- A state-of-the-art review of parallel-machine scheduling research
- To be fair or efficient or a bit of both
- Inequality measures and equitable locations
- Generalized Gini inequality indices
- Second-order cone programming
- Revisiting \(k\)-sum optimization
- An efficient primal-dual algorithm for fair combinatorial optimization problems
- An exact algorithm for the minimum squared load assignment problem
- Equitable aggregations and multiple criteria analysis
- Alternative formulations for the ordered weighted averaging objective
- An evolutionary algorithm for the vehicle routing problem with route balancing
- Mixed integer nonlinear programming tools: an updated practical overview
- Ordered weighted average combinatorial optimization: formulations and their properties
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Equality measures properties for location problems
- New techniques for cost sharing in combinatorial optimization games
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Solution of a Min-Max Vehicle Routing Problem
- Perspective Reformulation and Applications
- The Price of Fairness
- The Bargaining Problem
- Location Theory
- Decomposition Principle for Linear Programs
- Two exact algorithms for the distance-constrained vehicle routing problem
- How to Cut A Cake Fairly
- Centers to centroids in graphs
- From the median to the generalized center
- Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
- Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
- Fairness in Scheduling
- On cent-dians of general networks
- On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach
- Approximation Algorithms for Minimum-Load k -Facility Location
- Optimal vehicle routing with lower and upper bounds on route durations
