The Sharing Problem
From MaRDI portal
Publication:4177292
DOI10.1287/opre.27.2.324zbMath0394.90039OpenAlexW2141546571MaRDI QIDQ4177292
Publication date: 1979
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.27.2.324
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10)
Related Items (26)
Linear and combinatorial sharing problems ⋮ Minimum dispersion problems ⋮ A solution to the random assignment problem on the full preference domain ⋮ A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem ⋮ Fairness criteria for allocating scarce resources ⋮ A generalized bi-criteria fuzzy integer flow sharing problem ⋮ Fair-by-design matching ⋮ 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 ⋮ Allocation rules on networks ⋮ A submodular optimization problem with side constraints ⋮ Effective metaheuristic algorithms for the minimum differential dispersion problem ⋮ Solving the maximum min-sum dispersion by alternating formulations of two different problems ⋮ Flow sharing and bankruptcy games ⋮ A strongly polynomial time algorithm for a constrained submodular optimization problem ⋮ Asignacion de recuerdos max-min: Propiedades y algoritmos ⋮ Towards equitable distribution via proportional equity constraints ⋮ The equitable dispersion problem ⋮ Fuzzy sharing problem ⋮ The balanced linear programming problem ⋮ Fuzzy sharing problem by possibility measure ⋮ The flow circulation sharing problem ⋮ Generalized lexicographically optimal flows in networks with multiple sources and sinks ⋮ Optimal sharing ⋮ Solving knapsack sharing problems with general tradeoff functions
This page was built for publication: The Sharing Problem
