The Knapsack Sharing Problem

DOI10.1287/OPRE.27.2.341MaRDI QIDQ4177325zbMATH OpenOpenAlexFDO

Authors J. Randall Brown

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

zbMATH Keywords

AlgorithmsKnapsack Sharing Problem

Mathematics Subject Classification ID

Operations research and management science (90B99) Integer programming (90C10)

Cited in

(31)

• Optimal building evacuation time considering evacuation routes
• The equitable dispersion problem
• A graphical method to solve a maximin allocation problem
• Linear and combinatorial sharing problems
• A nonlinear minimax allocation problem with multiple knapsack constraints
• Reshipments and overshipments in transportation problems with minimax objective
• The balanced linear programming problem
• Relaxation-based algorithms for minimax optimization problems with resource allocation applications
• Heuristic and reduction algorithms for the knapsack sharing problem
• Effective metaheuristic algorithms for the minimum differential dispersion problem
• Solving the maximum min-sum dispersion by alternating formulations of two different problems
• 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
• New upper bounds and exact methods for the knapsack sharing problem
• An exact algorithm 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
• Fair and efficient allocation with few agent types, few item types, or small value levels
• Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study
• Optimality conditions for distributive justice
• An exact decomposition algorithm for the generalized knapsack sharing problem
• Asignacion de recuerdos max-min: Propiedades y algoritmos
• Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item
• Minmax linear knapsack problem with grouped variables and gub
• The flow circulation sharing problem
• An exact algorithm for large knapsack sharing problems
• Knapsack-sharing model for hybrid hosting of enterprise resource planning software on IaaS clouds
• Worst-case fair guarantees when spending a common budget
• Solving knapsack sharing problems with general tradeoff functions
• An exact algorithm for the knapsack sharing problem with common items

This page was built for publication: The Knapsack Sharing Problem

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