search query: @indexterm BRANCH AND BOUND METHODS / total: 70
references: 21-30 / 70
« previous page | next page »
 titleyearauthor
21.
Facility siting and integer-friendly programming
European Journal of Operational Research
1993 : MAR 12, VOL. 65:2, p. 147-158
 1993 ReVelle, C.
22.
Adapting branch-and-bound for real-world scheduling problems.
Journal of the Operational Research Society
1993 : MAY, VOL. 44:5, p. 483-490
 1993
23.
A multiplier adjustment approach for the set partitioning problem
Operations Research
1992 : JAN-FEB, VOL. 40:SUP.1, p.S40-S47
 1992 Chan, T. J.
Yano, C. A.
24.
A branch-and-bound procedures for the multiple resource-constrained project scheduling problem
Management Science
1992 : DEC, VOL. 38:12, p. 1803-1818
 1992 Demeulemeester, E.
Herroelen, W.
25.
Two-stage flowshop scheduling problem with bicriteria
Journal of the Operational Research Society
1992 : SEP, VOL. 43:9, p. 871-884
 1992 Rajendran, C.
26.
Location of facilities producing airborne pollution
Journal of the Operational Research Society
1992 : APR, VOL. 43:4, p. 313-320
 1992 Karkazis, J.
Boffey, T.B.
Malevris, N.
27.
On the single-machine scheduling problem with tardiness penalties
Journal of the Operational Research Society
1991 : AUG, VOL. 42:8, p. 695-702
 1991 Sen, T.
Borah, B.N.
28.
On the single-machine scheduling problem with tardiness penalties
Journal of the Operational Research Society
1991 : AUG, VOL. 42:8, p. 695-702
 1991 Sen, T.
Borah, B. N.
29.
A queuing network model for analysing a class of branch-and-bound algorithms on a master-slave architecture.
Operations Research
1991 : NOV-DEC, VOL. 39:6, p. 1005-1017
 1991 Boxma, O. J.
Kindervater, G. A. P.
30.
On the calculation of true and pseudo penalties in multiple choice integer programming.
European Journal of Operational Research
1991 : NOV 25, VOL. 55:2, p. 228-236
 1991 Lin, E. Y. H.
Bricker, D. L.
« previous page | next page »
SCIMA