The linear multiple choice knapsack problem with equity constraints

MaRDI QIDQ2505312zbMATH OpenFDO

Authors George Kozanidis, Emanuel Melachrinoudis, Marius M. Solomon

Publication date 4 October 2006

Published in International Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

balanced resource allocationbudget allocationequity constraintsfunds allocationgreedy algorithmhighway improvementslinear multiple choice knapsackroad improvements

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Solving the linear multiple choice knapsack problem with two objectives: Profit and equity
• Towards equitable distribution via proportional equity constraints
• The linear multiple choice knapsack problem
• A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
• The knapsack problem with disjoint multiple-choice constraints

Cited in

(4)

• Price of fairness for allocating a bounded resource
• Towards equitable distribution via proportional equity constraints
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• Solving the linear multiple choice knapsack problem with two objectives: Profit and equity

This page was built for publication: The linear multiple choice knapsack problem with equity constraints

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