Research Reports from the Department of Operations
Document Type
Report
Publication Date
2-1-1973
Abstract
This work represents chapter 12 of a forthcoming textbook entitled “Integer Programming” to be written by Harvey M. Salkin.
Keywords
Operations research, Integer programming, Branch and bound algorithms, Knapsack problem (Mathematics), Dynamic programming, Capital budget
Publication Title
Integer Programming (1975); Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 289
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Salkin, Harvey M., "Integer programming : the knapsack problem (including : the capital budgeting problem the cutting stock problem)" (1973). Research Reports from the Department of Operations. 269.
https://commons.case.edu/wsom-ops-reports/269