Multi-constrained matroidal knapsack problems
- 1 August 1989
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 45 (1) , 211-231
- https://doi.org/10.1007/bf01589104
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The matroidal knapsack: A class of (often) well-solvable problemsOperations Research Letters, 1984
- Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling ProblemsMathematics of Operations Research, 1983
- A computational study of a multiple-choice knapsack algorithmACM Transactions on Mathematical Software, 1983
- Generalized Subgradients in Mathematical ProgrammingPublished by Springer Nature ,1983
- Integer Programming Models for Sales Resource AllocationManagement Science, 1980
- A mathematical programming system for preference and compatibility maximized menu planning and schedulingMathematical Programming, 1978
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970
- Three Problems in Rationing CapitalThe Journal of Business, 1955