Similar Search Results

A combinatorial property of the maximum round robin tournament problem

Horbach, Andrei - In: Operations research letters 38 (2010) 2, pp. 121-122

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

A boolean satisfiability approach to the resource-constrained project scheduling problem

Horbach, Andrei - 2009

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

A new class of valid inequalities for the round robin tournament problem

Horbach, Andrei - 2008

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

A Boolean satisfiability approach to the resource-constrained project scheduling problem

Horbach, Andrei - 2010

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

A boolean satisfiability approach to the resource-constrained project scheduling problem

Horbach, Andrei - 2009

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

Combinatorial relaxation of the k-traveling salesman problem

Horbach, Andrei - 2005

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

Combinatorial relaxation of the k-traveling salesman problem

Horbach, Andrei - 2005

The k-traveling salesman problem, or k-TSP is: given a graph with edge weights and an integer k, find a simple cycle of minimum weight visiting exactly k nodes. To obtain lower bounds for the traveling salesman problem the 2-matching relaxation and the 1-tree relaxation can be used. We...

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

Optimally scheduling real world sports leagues by reduction to SAT

Horbach, Andrei; Bartsch, Thomas; Briskorn, Dirk - 2009

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

A Lagrangian approach for minimum cost tournaments

Briskorn, Dirk; Horbach, Andrei - 2009

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

Using a SAT-solver to schedule sports leagues

Horbach, Andrei; Bartsch, Thomas; Briskorn, Dirk - In: Journal of scheduling 15 (2012) 1, pp. 117-125

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