Quadratic knapsack problems
- 1 January 1980
- book chapter
- Published by Springer Nature
- p. 132-149
- https://doi.org/10.1007/bfb0120892
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The knapsack problem: A surveyNaval Research Logistics Quarterly, 1975
- Constraint Pairing In Integer ProgrammingINFOR: Information Systems and Operational Research, 1975
- A Capital Budgeting Heuristic Algorithm Using Exchange OperationsA I I E Transactions, 1974
- Concave minimization over a convex polyhedronNaval Research Logistics Quarterly, 1973
- Notes—On a Selection ProblemManagement Science, 1970
- A Selection Problem of Shared Fixed Costs and Network FlowsManagement Science, 1970
- Quadratic Binary Programming with Application to Capital-Budgeting ProblemsOperations Research, 1970
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme PointsOperations Research, 1970
- Fixed‐cost transportation problemsNaval Research Logistics Quarterly, 1961
- An algorithm for solving the transportation problem when the shipping cost over each route is convexNaval Research Logistics Quarterly, 1959