Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Bitran, G.R., Theory and algorithms for linear multiple objective programs with zero-one variables, Math. Progr. 17 (1979) 362–390.
2. Camerini, P.M., and Vercellis, C., The matroidal knapsack: a class of (often) well-solvable problems, Operations Research Letters 3 (1984) 157–162.
3. Chalmet, L.G., Lemonidis, L., and Elzinga, D.J., An algorithm for the bicriterion integer programming problem, European J. of Operations Resear (1986) 292–300.
4. Dyer, M.E., and Walker, J., A note on bicriterion programming, Math. Progr. 27 (1983) 355–361.
5. Garey, M.R., and Johnson, D.S., Computers and intractability, Freeman, San Francisco, USA, 1979.
Cited by
69 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献