The impact of branch direction history combined with global branch history in branch predictionKWAK, Jong Wook; KIM, Ju-Hwan; JHON, Chu Shik et al.IEICE transactions on information and systems. 2005, Vol 88, Num 7, pp 1754-1758, issn 0916-8532, 5 p.Article

Single-machine scheduling to minimize absolute deviation of completion times from a common due dateSZWARC, W.Naval research logistics. 1989, Vol 36, Num 5, pp 663-673, issn 0894-069X, 11 p.Article

Branch classification : A new mechanism for improving branch predictor performancePO-YUNG CHANG; HAO, E; TSE-YU YEH et al.International journal of parallel programming. 1996, Vol 24, Num 2, pp 133-158, issn 0885-7458Article

An improved branching scheme for the branch and bound procedure of scheduling n jobs on m parallel machines to minimize total weighted flowtimeSARIN, S. C; AHN, S; BISHOP, A. B et al.International journal of production research. 1988, Vol 26, Num 7, pp 1183-1191, issn 0020-7543Article

Scheduling jobs with release dates and tails on identical machines to minimize the makespanCARLIER, J.European journal of operational research. 1987, Vol 29, Num 3, pp 298-306, issn 0377-2217Article

Scheduling tasks with sequence-dependent processing timesBIANCO, L; RICCIARDELLI, S; RINALDI, G et al.Naval research logistics. 1988, Vol 35, Num 2, pp 177-184, issn 0894-069XArticle

The fixed job schedule problem with spread-time constraintsFISCHETTI, M; MARTELLO, S; TOTH, P et al.Operations research. 1987, Vol 35, Num 6, pp 849-858, issn 0030-364XArticle

Some branch-and-bound procedures for fixed-cost transportation problemsCABOT, A. V; ERENGUE, S. S.Naval research logistics quarterly. 1984, Vol 31, Num 1, pp 145-154, issn 0028-1441Article

A branch-and-cut algorithm for two-stage stochastic mixed-binary programs with continuous first-stage variablesNTAIMO, Lewis; SEN, Suvrajeet.International journal of computational science and engineering (Print). 2007, Vol 3, Num 3, pp 232-241, issn 1742-7185, 10 p.Article

Parallel branch, cut, and price for large-scale discrete optimizationRALPHS, T. K; LADANYI, L; SALTZMAN, M. J et al.Mathematical programming. 2003, Vol 98, Num 1-3, pp 253-280, issn 0025-5610, 28 p.Conference Paper

A simulated annealing approach to scheduling a manufacturing cellVAKHARIA, A. J; YIH-LONG CHANG.Naval research logistics. 1990, Vol 37, Num 4, pp 559-577, issn 0894-069X, 19 p.Article

An exact solution method for the MTSPAHMAD HUSBAN.The Journal of the Operational Research Society. 1989, Vol 40, Num 5, pp 461-469, issn 0160-5682, 9 p.Article

Distributed implementation of a parallel branch and bound algorithm on a processor farmAUTHIE, G; ELKIHEL, M; VIADER, F et al.Strategem '96. Symposium. 1996, pp 171-186, isbn 2-7261-0982-9Conference Paper

Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problemSPRECHER, A; KOLISCH, R; DREXL, A et al.European journal of operational research. 1995, Vol 80, Num 1, pp 94-102, issn 0377-2217Article

Improving the productivity of electroplating lines by changing the layout of the tanksVARNIER, C; GRUNDER, O; BAPTISTE, P et al.INRIA / IEEE symposium on emerging technologies and factories automation. 1995, pp 441-450, isbn 0-7803-2535-4, 3VolConference Paper

Adapting branch-and-bound for real-world scheduling problemsVASKO, F. J; WOLF, F. E; STOTT, K. L et al.The Journal of the Operational Research Society. 1993, Vol 44, Num 5, pp 483-490, issn 0160-5682Article

Dynamic programming state-space relaxation for single-machine schedulingABDUL-RAZAQ, T. S; POTTS, C. N.The Journal of the Operational Research Society. 1988, Vol 39, Num 2, pp 141-152, issn 0160-5682Article

A branch-and-bound algorithm for computing node weighted Steiner minimum treesXUE, G.Lecture notes in computer science. 1997, pp 383-392, issn 0302-9743, isbn 3-540-63357-XConference Paper

A probabilistic model for best-first search B&B algorithmsARGÜELLO, F; GUIL, N; LOPEZ, J et al.Lecture notes in computer science. 1997, pp 49-60, issn 0302-9743, isbn 3-540-63138-0Conference Paper

Decomposition of the single machine total tardiness problemSZWARC, W; MUKHOPADHYAY, S. K.Operations research letters. 1996, Vol 19, Num 5, pp 243-250, issn 0167-6377Article

A global optimization method, αBB, for process designADJIMAN, C. S; ANDROULAKIS, I. P; MARANAS, C. D et al.Computers & chemical engineering. 1996, Vol 20, pp S419-S424, issn 0098-1354, SUPAConference Paper

Parallel branch and bound algorithms for a class of scheduling problemsRAHOUAL, M.INRIA / IEEE symposium on emerging technologies and factories automation. 1995, pp 405-416, isbn 0-7803-2535-4, 3VolConference Paper

Computational aspects and applications of a branch and bound algorithm for fuzzy multistage decision processesESOGBUE, A. O.Computers & mathematics with applications (1987). 1991, Vol 21, Num 11-12, pp 117-127, issn 0898-1221Conference Paper

A branch- and -bound approach to the bicriterion scheduling problem involving total flowtime and range of latenessTAPAN SEN; RAISZADEH, F. M. E; PARTHASARATI DILEEPAN et al.Management science. 1988, Vol 34, Num 2, pp 254-260, issn 0025-1909Article

A parallel branch and bound algorithm for the quadratic assignment problemROUCAIROL, C.Discrete applied mathematics. 1987, Vol 18, Num 2, pp 211-225, issn 0166-218XArticle