haku: @indexterm BRANCH AND BOUND METHODS / yhteensä: 70
viitteet: 11-20 / 70
« edellinen sivu | seuraava sivu »
 otsikkovuositekijä
11.
Optimal sequencing of skip collections and deliveries
Journal of the Operational Research Society
1997 : JAN, VOL. 48:1, p. 57-64
 1997 Muelemeester, L.De. et al
12.
A graph colouring model for assigning a heterogeneous workforce to a given schedule.
European Journal of Operational Research
1996 : APR 19, VOL. 90:2, p. 285-302
 1996 Valls, V.
Perez, A.
Quintanilla, S.
13.
Optimal location of routes for vehicles transporting hazardous materials
European Journal of Operational Research
1995 : OCT 19, VOL. 86:2, p. 201-215
 1995 Karkazis, J.
Boffey, T.
14.
A new aggregation-disaggregation algorithm
European Journal of Operational Research
1995 : JUN 22, VOL. 83:3, p. 655-669
 1995 Shioyama, T.
Tanaka, K.
15.
Industrial linear optimization problems solved by constraint logit programming
European Journal of Operational Research
1995 : JUL 7, VOL. 84:1, p. 82-95
 1995 Bisdorff, R.
Laurent, S.
16.
Minimizing a quadratic cost function of waiting times in single-machine scheduling
Journal of the Operational Research Society
1995 : JUN, VOL. 46:6, p. 753-761
 1995 Szwarc, W.
Mukhopadhyay, S.
17.
A branch-and-bound approach for a two-machine flowshop scheduling problem
Journal of the Operational Research Society
1995 : JUN, VOL. 46:6, p. 721-734
 1995 Nagar, A.
Heragu, S.
Haddock, J.
18.
A parallel depth first search branch and bound algorithm for the quadratic assignment problem
European Journal of Operational Research
1995 : MAR 16, VOL. 81:3, p. 617-628
 1995 Mans, B.
Mautor, T.
Roucariol, C.
19.
Adjustment of heads and tails for the job-shop problem
European Journal of Operational Research
1994 : OCT 27, VOL. 78:2, p. 146-161
 1994 Carlier, J.
Pinson, E.
20.
Microcomputer performance of "FABLE" on Hoffmann's data sets with reply by T.R. Hoffmann
Management Science
1993 : OCT, VOL. 39:10, p. 1190-1193
 1993 Johnson, R.V.
« edellinen sivu | seuraava sivu »
SCIMA