Narrow search
Showing 1 - 10 of 415
Cover Image
A branching scheme for minimum cost tournaments with regard to real world constraints
Briskorn, Dirk - 2009
Single round robin tournaments are a well known class of sports leagues schedules. We consider leagues with a set T of n teams where n is even. Costs are associated to each possible match. Moreover, stadium availability, fixed matches, and regions' capacities are taken into account. The goal is...
Persistent link: https://www.econbiz.de/10011558714
Cover Image
A branching scheme based on First-Break-Then-Schedule decomposition
Briskorn, Dirk; Drexl, Andreas - 2007
Single round robin tournaments are a well known class of sports leagues schedules. We consider leagues with a set T of n teams where n is even. Costs are associated to each possible match. The goal is to find the minimum cost tournament among those having the minimum number of breaks. We pick up...
Persistent link: https://www.econbiz.de/10011558829
Cover Image
An enhanced branch-and-bound algorithm for the talent scheduling problem
Qin, Hu; Zhang, Zizhen; Lim, Andrew; Liang, Xiaocong - In: European journal of operational research : EJOR 250 (2016) 2, pp. 412-426
Persistent link: https://www.econbiz.de/10011441587
Cover Image
The two-machine flowshop total completion time problem : branch-and-bound algorithms based on network-flow formulation
Detienne, Boris; Sadykov, Ruslan; Tanaka, Shunji - In: European journal of operational research : EJOR 252 (2016) 3, pp. 750-760
Persistent link: https://www.econbiz.de/10011472309
Cover Image
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo; Coniglio, Stefano; Furini, Fabio; … - In: European journal of operational research : EJOR 278 (2019) 1, pp. 76-90
Persistent link: https://www.econbiz.de/10012102594
Cover Image
A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling
Wang, Shijin; Liu, Ming; Chu, Chengbin - In: International journal of production research 53 (2015) 4, pp. 1143-1167
Persistent link: https://www.econbiz.de/10010493576
Cover Image
Two-machine flow shop scheduling with deteriorating jobs : minimizing the weighted sum of makespan and total completion time
Cheng, Mingbao; Tadikamalla, Pandu R.; Shang, Jennifer; … - In: Journal of the Operational Research Society : OR 66 (2015) 5, pp. 709-719
Persistent link: https://www.econbiz.de/10011302311
Cover Image
A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates
Rakrouki, Mohamed Ali; Kooli, Anis; Chalghoumi, Sabrine; … - In: Operational research : an international journal 20 (2020) 1, pp. 21-35
Persistent link: https://www.econbiz.de/10012172846
Cover Image
A branching scheme based on First-Break-Then-Schedule decomposition
Briskorn, Dirk; Drexl, Andreas - 2007
Single round robin tournaments are a well known class of sports leagues schedules. We consider leagues with a set T of n teams where n is even. Costs are associated to each possible match. The goal is to find the minimum cost tournament among those having the minimum number of breaks. We pick up...
Persistent link: https://www.econbiz.de/10011723416
Cover Image
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
Li, Chu-Min; Jiang, Hua; Manyà, Felip - In: Computers & operations research : and their … 84 (2017), pp. 1-15
Persistent link: https://www.econbiz.de/10011710166