Sciweavers

2976 search results - page 226 / 596
» On the bounded integer programming
Sort
View
CPAIOR
2005
Springer
15 years 12 months ago
Constraint Programming Based Column Generation for Employee Timetabling
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
CCO
2001
Springer
168views Combinatorics» more  CCO 2001»
15 years 10 months ago
Mathematical Programming Models and Formulations for Deterministic Production Planning Problems
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
Yves Pochet
BIBE
2005
IEEE
124views Bioinformatics» more  BIBE 2005»
15 years 12 months ago
Approximate Global Alignment of Sequences
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
Tamer Kahveci, Venkatakrishnan Ramaswamy, Han Tao,...
ICALP
2005
Springer
15 years 11 months ago
On Dynamic Bit-Probe Complexity
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
Corina E. Patrascu, Mihai Patrascu
COCO
2004
Springer
78views Algorithms» more  COCO 2004»
15 years 11 months ago
Language Compression and Pseudorandom Generators
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
Harry Buhrman, Troy Lee, Dieter van Melkebeek