haku: @indexterm Knapsack problem / yhteensä: 30
viitteet: 22-30 / 30
« edellinen sivu | seuraava sivu »
 otsikkovuositekijä
22.
Heuristics and reduction methods for multiple constraints 0-1 linear programming problems. (!heuristics,reduction,surrogate)
European Journal of Operational Research
1986 : FEB, VOL. 24:2, p. 206-215
 1986 Freville, A.
Plateau, G.
23.
Some very easy knapsack/partition problems.
Operations Research
1985 : SEP-OCT, VOL. 33:5, p. 1154-1160
 1985 Orlin, J. B.
24.
A note on the Martello - Toth algorithm for one-dimensional knapsack problems.
European Journal of Operational Research
1985 : APR, VOL. 20:1, p. 117
 1985 Aittoniemi, L.
Oehlandt, K.
25.
The zero-one knapsack problem with equality constraint.
European Journal of Operational Research
1985 : MAR, VOL. 19:3, p. 384-389
 1985 Kaufman, L.
Plastria, F.
Tubeeckx, S.
26.
The stochastic linear continuous type knapsack problem : A generalized P model.
European Journal of Operational Research
1985 : JAN, VOL. 19:1, p. 118-124
 1985 Ishii, H.
Nishida, T.
27.
Approximation algorithms for the m-dimensional 0-1 knapsack problem : Worst-case and probabilistic analyses.
European Journal of Operational Research
1984 : JAN, VOL. 15:1, p. 100-109
 1984 Frieze, A. M.
Clarke, M. R. B.
28.
A heuristic lagrangean algorithm for the capacitated plant location problem.
European Journal of Operational Research
1984 : FEB, VOL. 15:2, p. 212-226
 1984 Barcelo, J.
Casanovas, J.
29.
Resource allocation with tree constraints.
Operations Research
1983 : SEP-OCT, VOL. 31:5, p. 881-890
 1983 Mjelde, K. M.
30.
The multiple-choice nested knapsack model.
Management Science
1982 : JAN, VOL. 28:1, p. 34-43
 1982 Armstrong, R. D.
Sinha, P.
Zoltners, A. A.
« edellinen sivu | seuraava sivu »
SCIMA