In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
We discuss the problem of fitting an implicit shape model to a set of points sampled from a co-dimension one manifold of arbitrary topology. The method solves a non-convex optimis...
Christian Walder, Olivier Chapelle, Bernhard Sch&o...
Abstract. In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignme...
Philippe Veber, Nicola Yanev, Rumen Andonov, Vince...
The Web is widely used, in educational settings, typically as a repository of contents to be learned. Within this approach, the Web-searching process tends to be perceived merely a...