Sciweavers

2976 search results - page 90 / 596
» On the bounded integer programming
Sort
View
EOR
2007
78views more  EOR 2007»
15 years 6 months ago
A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
Video on Demand (VoD) is a technology used to provide a number of programs to a number of users on request. In developing a VoD system, a fundamental problem is load balancing, wh...
Tolga Bektas, Osman Oguz, Iradj Ouveysi
CONSTRAINTS
2011
14 years 10 months ago
CP and IP approaches to cancer radiotherapy delivery optimization
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...
Davaatseren Baatar, Natashia Boland, Sebastian Bra...
ICALP
1999
Springer
15 years 11 months ago
Bounded Depth Arithmetic Circuits: Counting and Closure
Eric Allender, Andris Ambainis, David A. Mix Barri...
IFIP
1999
Springer
15 years 11 months ago
Aura II: Combining Negative Thinking and Branch-and-Bound in Unate Covering Problems
Luca P. Carloni, Evguenii I. Goldberg, Tiziano Vil...
AAAI
2006
15 years 8 months ago
Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning
Several forms of reasoning in AI
Georg Gottlob, Reinhard Pichler, Fang Wei