Sciweavers

21 search results - page 3 / 5
» Constraint Integer Programming: A New Approach to Integrate ...
Sort
View
INFORMS
1998
150views more  INFORMS 1998»
13 years 4 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
CP
2003
Springer
13 years 10 months ago
Redundant Modeling for the QuasiGroup Completion Problem
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
Iván Dotú, Alvaro del Val, Manuel Ce...
CP
2005
Springer
13 years 10 months ago
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
Grégoire Dooms, Yves Deville, Pierre Dupont
ICPP
1998
IEEE
13 years 9 months ago
High-Level Information - An Approach for Integrating Front-End and Back-End Compilers
We propose a new universal High-Level Information (HLI) format to effectively integrate front-end and back-end compilers by passing front-end information to the back-end compiler....
Sangyeun Cho, Jenn-Yuan Tsai, Yonghong Song, Bixia...
CP
2003
Springer
13 years 10 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...