Similar Search Results

Combinatorial Properties of Strength Groups in Round Robin Tournaments

Briskorn, Dirk - 2006

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

Integer programming models for round robin tournaments

Briskorn, Dirk; Drexl, Andreas - 2006

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

Round robin tournaments and three index assignments

Briskorn, Dirk; Drexl, Andreas; Spieksma, Frits C. R. - In: 4OR : a quarterly journal of operations research 8 (2010) 4, pp. 365-374

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

Reducing the 0-1 knapsack problem with a single continuous variable to the standard 0-1 knapsack problem

Büther, Marcel; Briskorn, Dirk - 2007

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

Round robin tournaments and three index assignment

Briskorn, Dirk; Drexl, Andreas; Spieksma, Frits C. R. - 2005

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

A Lagrangian approach for minimum cost single round robin tournaments

Briskorn, Dirk; Horbach, Andrei - In: Computers & operations research : and their … 39 (2012) 3, pp. 718-727

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

IP models for round robin tournaments

Briskorn, Dirk; Drexl, Andreas - In: Computers & operations research : and their … 36 (2009) 3, pp. 837-852

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

Mathematical programming models for lock scheduling with an emission objective

Passychan, Ward; Briskorn, Dirk; Spieksma, Frits C. R. - In: European journal of operational research : EJOR 249 (2016) 3, pp. 802-814

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

The replenishment problem with multiple articles and an order threshold

Briskorn, Dirk; Wensing, Thomas - In: Computers & operations research : and their … 136 (2021), pp. 1-12

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

Reducing the 0-1 knapsack problem with a single continuous variable to the standard 0-1 knapsack problem

Büther, Marcel; Briskorn, Dirk - 2007

The 0-1 knapsack problem with a single continuous variable (KPC) is a natural extension of the binary knapsack problem (KP), where the capacity is not any longer fixed but can be extended which is expressed by a continuous variable. This variable might be unbounded or restricted by a lower or...

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