The Knapsack Sharing Problem
From MaRDI portal
Publication:4177325
DOI10.1287/opre.27.2.341zbMath0394.90065OpenAlexW2155921933MaRDI QIDQ4177325
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.341
Related Items
Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study, An exact algorithm for large knapsack sharing problems, A graphical method to solve a maximin allocation problem, Linear and combinatorial sharing problems, Relaxation-based algorithms for minimax optimization problems with resource allocation applications, An exact decomposition algorithm for the generalized knapsack sharing problem, Heuristic and reduction algorithms for the knapsack sharing problem, New upper bounds and exact methods for the knapsack sharing problem, A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem, Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS, Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item, Fair and efficient allocation with few agent types, few item types, or small value levels, A nonlinear minimax allocation problem with multiple knapsack constraints, Reshipments and overshipments in transportation problems with minimax objective, Optimality conditions for distributive justice, Effective metaheuristic algorithms for the minimum differential dispersion problem, Solving the maximum min-sum dispersion by alternating formulations of two different problems, Minmax linear knapsack problem with grouped variables and gub, An exact algorithm for the knapsack sharing problem, Asignacion de recuerdos max-min: Propiedades y algoritmos, Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study, Towards equitable distribution via proportional equity constraints, Bounded knapsack sharing, Optimal building evacuation time considering evacuation routes, The equitable dispersion problem, The balanced linear programming problem, The flow circulation sharing problem, Solving knapsack sharing problems with general tradeoff functions, An exact algorithm for the knapsack sharing problem with common items
