Sciweavers

332 search results - page 8 / 67
» The Monochromatic Column problem
Sort
View
DISOPT
2006
155views more  DISOPT 2006»
13 years 9 months ago
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
Dorit S. Hochbaum, Asaf Levin
CP
1999
Springer
14 years 2 months ago
A Framework for Constraint Programming Based Column Generation
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...
Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Bo ...
IPL
2008
78views more  IPL 2008»
13 years 9 months ago
An approximation ratio for biclustering
The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters ...
Kai Puolamäki, Sami Hanhijärvi, Gemma C....
SG
2005
Springer
14 years 3 months ago
A Smart Algorithm for Column Chart Labeling
This paper presents a smart algorithm for labeling column charts and their derivatives. To efficiently solve the problem, we separate it into two sub-problems. We first present a ...
Sebastian Müller, Arno Schödl
IPCO
2010
160views Optimization» more  IPCO 2010»
13 years 11 months ago
On Column-Restricted and Priority Covering Integer Programs
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov...
Deeparnab Chakrabarty, Elyot Grant, Jochen Kö...