Budgeting with bounded multiple-choice constraints

@article{Pisinger2001BudgetingWB,
  title={Budgeting with bounded multiple-choice constraints},
  author={David Pisinger},
  journal={European Journal of Operational Research},
  year={2001},
  volume={129},
  pages={471-480}
}
We consider a budgeting problem where a speciied number of projects from some disjoint classes has to be selected such that the overall gain is largest possible, and such that the costs of the chosen projects do not exceed a xed upper limit. The problem has several application in government budgeting, planning, and as relaxation from other combinatorial problems. It is demonstrated that the problem can be transformed to an equivalent Multiple-choice Knapsack Problem through dynamic programming… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 12 extracted citations

A new multi-objective algorithm for a project selection problem

Advances in Engineering Software • 2009
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-3 of 3 references

The Multiple-Choice Knapsack Problem

Operations Research • 1979
View 7 Excerpts
Highly Influenced

An Algorithm for Large Zero-One Knapsack Prob- lems

E.Balas, E. Zemel
Operations Research, • 1980
View 5 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…