Search Results - subject:"Branch and bound method"

Narrow search

An exact solution method for unconstrained quadratic 0–1 programming: a geometric approach

Li, D.; Sun, X.; Liu, C. - In: Journal of Global Optimization 52 (2012) 4, pp. 797-829

Persistent link: https://www.econbiz.de/10010845828

Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods

Fernández, José; Tóth, Boglárka - In: Computational Optimization and Applications 42 (2009) 3, pp. 393-419

Persistent link: https://www.econbiz.de/10005616072

Optimal Scheduling of a Two-stage Hybrid Flow Shop

Haouari, Mohamed; Hidri, Lotfi; Gharbi, Anis - In: Computational Statistics 64 (2006) 1, pp. 107-124

We present an exact branch-and-bound algorithm for the two-stage hybrid flow shop problem with multiple identical machines in each stage. The objective is to schedule a set of jobs so as to minimize the makespan. This is the first exact procedure which has been specifically designed for this...

Persistent link: https://www.econbiz.de/10010847763

Optimal Scheduling of a Two-stage Hybrid Flow Shop

Haouari, Mohamed; Hidri, Lotfi; Gharbi, Anis - In: Mathematical Methods of Operations Research 64 (2006) 1, pp. 107-124

Persistent link: https://www.econbiz.de/10010999783