Learn More
R ´ ESUMÉ : We consider two variants of knapsack problems with setups arising as subproblems in a Dantzig-Wolfe decomposition approach to more complex combinatorial optimization problems. In the multiple-class binary knapsack problem with setups, items are partitioned into classes whose use implies a setup cost and associated capacity consumption. Item(More)
For content based image retrieval using shape descriptors, most approaches so far extract shape information from a seg-mentation of the image. Shape features derived based on a specific segmentation are not suitable for images containing complex structures. Further, static segmentation based approaches are useful only for a small set of queries. In this(More)
the date of receipt and acceptance should be inserted later Abstract. When a column generation approach is applied to decomposable mixed integer programming problems, it is standard to formulate and solve the master problem as a linear program. Seen in the dual space, this results in the algorithm known in the nonlinear programming community as the(More)
In the past decade, significant progress has been achieved in developing generic primal heuristics that made their way into commercial mixed integer programming (MIP) solver. Extensions to the context of a column generation solution approach are not straightforward. The Dantzig-Wolfe decomposition principle can indeed be exploited in greedy, local search,(More)
MOTIVATION We present a pipeline for the pre-processing, quality assessment, read distribution and methylation estimation for methylated DNA immunoprecipitation (MeDIP)-sequence datasets. This is the first MeDIP-seq-specific analytic pipeline that starts at the output of the sequencers. This pipeline will reduce the data analysis load on staff and allows(More)
  • 1