Sciweavers

8 search results - page 2 / 2
» Minimal retentive sets in tournaments
Sort
View
WAOA
2010
Springer
275views Algorithms» more  WAOA 2010»
13 years 8 months ago
Online Ranking for Tournament Graphs
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
Claire Mathieu, Adrian Vladu
EOR
2007
174views more  EOR 2007»
13 years 10 months ago
A Benders approach for the constrained minimum break problem
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
Rasmus V. Rasmussen, Michael A. Trick
CNSM
2010
13 years 8 months ago
DP+IP = design of efficient backup scheduling
Many industries experience an explosion in digital content. This explosion of electronic documents, along with new regulations and document retention rules, sets new requirements f...
Ludmila Cherkasova, Alex Zhang, Xiaozhou Li