The Sharing Problem
From MaRDI portal
Cited in
(27)- The equitable dispersion problem
- Linear and combinatorial sharing problems
- On the solution of discrete bottleneck problems
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
- An algorithm for the fair resource allocation problem with a submodular constraint
- Fuzzy sharing problem
- The balanced linear programming problem
- Fuzzy sharing problem by possibility measure
- Minimum dispersion problems
- Effective metaheuristic algorithms for the minimum differential dispersion problem
- Solving the maximum min-sum dispersion by alternating formulations of two different problems
- Towards equitable distribution via proportional equity constraints
- Fairness criteria for allocating scarce resources
- Fair-by-design matching
- A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem
- Asignacion de recuerdos max-min: Propiedades y algoritmos
- Generalized lexicographically optimal flows in networks with multiple sources and sinks
- Optimal sharing
- A generalized bi-criteria fuzzy integer flow sharing problem
- A submodular optimization problem with side constraints
- The flow circulation sharing problem
- Allocation rules on networks
- Flow sharing and bankruptcy games
- A strongly polynomial time algorithm for a constrained submodular optimization problem
- Egalitarian random assignment
- Solving knapsack sharing problems with general tradeoff functions
- A solution to the random assignment problem on the full preference domain
This page was built for publication: The Sharing Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4177292)
